3 Apr
2006
3 Apr
'06
7:05 p.m.
It was thus said that the Great Richard once stated:
In article <20060404010103.EFBD873029 at linus.area51.conman.org>,
spc at conman.org (Sean 'Captain Napalm' Conner) writes:
The algorithm is the same, whether its arrays or linked lists is
simply an implementation detail :-). (Famous last words for a
programmer!)
Not quite. With an array, one can start at the end (you do need to keep
track of how big the array is) and work your way forward.
-spc (Famous last words indeed ... 8-)
Another
example is a sequence that starts out nearly chaotic, but
eventually settles into a period N attractor loop. [...]
Yes, I've written code like that, but in those cases I've used arrays, not
linked lists (as the upper bounds for looping were set beyond which they
were considered "infinite").