Radix_Theory.pdf

×

A special thanks to ROG for this commented source code.. More to come

Download the source files below

Attachments


Subscribe
Notify of
guest

3 Comments
Newest
Oldest
Inline Feedbacks
View all comments
ROG
ROG
1 year ago

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 🙂

Annatar
Annatar
Reply to  ROG
1 year ago

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.

ROG
ROG
Reply to  Annatar
1 year ago

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”.

3
0
Would love your thoughts, please comment.x
()
x