Not working? update your browser or Try Chrome! A special thanks to ROG for this commented source code.. More to come Download the source files below Attachments bobs File size: 69 KB Downloads: 263 Publication Read more…
Full Screen Grab the SRC from here Publication author offline 1 day mus@shi9 0 Comments: 1160Publics: 2778Registration: 06-03-2017
Full Screen Attachments OBLITERATOR File size: 40 KB Downloads: 548 Publication author offline 1 day mus@shi9 0 Comments: 1160Publics: 2778Registration: 06-03-2017
Only want to mention that I am not the author of the Radix_Theory document (the PDF you can see above). I found it on mikro’s Atari site and the author “?” seems to be unknown. Credits to “?” for the nice explanation and the inspiration 🙂
Now I’m intrigued: what could be the practical application of this in an intro or a demo?
We might be paving new ground here, and if we are, I’m super excited!
I myself often use hashed arrays in a doubly linked list because I do a lot of programming in AWK, and there hash arrays are core functionality, making sorting and lookups very fast (lookups are obviously O(1) with a hash array), but that’s solving day to day problems, which have nothing to do with intros.
Nothing groundbreaking new but the “Radix” should for instance come in quite handy for 3D stuff (like vectorballs) if more than ca. 20 objects have to be sorted.
Yeah, linked lists is an excellent catchword. This is another smart and (obviously) even more efficient approach to do the “Radix”.