3 Apr
2006
3 Apr
'06
6:11 p.m.
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!)
--
"The Direct3D Graphics Pipeline"-- code samples, sample chapter, FAQ:
<http://www.xmission.com/~legalize/book/>
Pilgrimage: Utah's annual demoparty
<http://pilgrimage.scene.org>
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").