Talk:Sparse array

Redundant
This article should link to the sparse matrix article, which is the same concept, but much better writing.

TeX showing
I'm not sure how to represent sparse arrays otherwise I would try to fix it up myself. Your TeX is showing. — Preceding unsigned comment added by 199.111.248.59 (talk) 16:49, 29 November 2012 (UTC)

Fewer iterations
"Also, when a linked list is used, the array elements can be accessed through fewer iterations than in a normal array."


 * Don't get this part. --77.20.127.214 (talk) 03:09, 17 June 2013 (UTC)


 * I don't get it either, sounds counter-intuitive. 185.31.142.251 (talk) 13:25, 29 June 2015 (UTC)

Sparse array a special case of a more general concept?
I know talk pages are not for asking questions or discussing a topic, but I have a feeling that sparse arrays may be a special case of a more general concept, and wonder whether that concept (which I don't know the name of) should be linked to from here. I am thinking that "in which most of the elements have the same value" (that is ai = k for some constant k, often 0), could be generalised to ai in K, where K is a set of values. Googling hasn't come up with anything for me, so maybe such a generalisation hasn't come up in the field? I find that hard to believe, though. --Lasse Hillerøe Petersen (talk) 22:06, 27 October 2013 (UTC)

Merging with Sparse matrix
The Sparse matrix page covers most everything here, more clearly, and with references. It had been around for a decade before this one was created as part of a class project it seems. The concept (numerical analysis) and representation (computer science) belong together. I've added in the bits that weren't there, and redirected this page there. ★NealMcB★ (talk) 21:13, 25 April 2017 (UTC)

India Education Program course assignment
This article was the subject of an educational assignment supported by Wikipedia Ambassadors through the India Education Program.

The above message was substituted from by PrimeBOT (talk) on 20:19, 1 February 2023 (UTC)