Talk:Array: Difference between revisions

From Rosetta Code
Content added Content deleted
(answer: not a task)
No edit summary
Line 2: Line 2:
:This isn't a task, but an explanation of a data structure (check the backlinks). The code is just for illustration, and it probably shouldn't use the {header} template.
:This isn't a task, but an explanation of a data structure (check the backlinks). The code is just for illustration, and it probably shouldn't use the {header} template.
:An associative array is an array in name only. It is a map of some sort underneath (e.g. alist, tree, hash). --[[User:IanOsgood|IanOsgood]] 15:00, 2 January 2008 (MST)
:An associative array is an array in name only. It is a map of some sort underneath (e.g. alist, tree, hash). --[[User:IanOsgood|IanOsgood]] 15:00, 2 January 2008 (MST)
::It seems to me that code can provide, at best, an illustration of how the data structure can be implemented. It may be worth working to avoid equating the data structure, per se, with specifics of implementation. --[[User:TBH|TBH]] 15:40, 2 January 2008 (PST)

Revision as of 23:40, 2 January 2008

What is this task actually asking to do? The explanation is reasonably straightforward (though it omits associative arrays entirely) but it doesn't say what is actually to be done. The single example (in C) computes a histogram over a file - is that what all (different-language) examples in this task should do? Sgeier 14:19, 2 January 2008 (MST)

This isn't a task, but an explanation of a data structure (check the backlinks). The code is just for illustration, and it probably shouldn't use the {header} template.
An associative array is an array in name only. It is a map of some sort underneath (e.g. alist, tree, hash). --IanOsgood 15:00, 2 January 2008 (MST)
It seems to me that code can provide, at best, an illustration of how the data structure can be implemented. It may be worth working to avoid equating the data structure, per se, with specifics of implementation. --TBH 15:40, 2 January 2008 (PST)