I have learnt about Dijkstra using Leonardo numbers (basically like Fibonacci, but his first name was Leonardo) to virtually treat indexed array as binary tree in 1981... and my head kinda exploded:

So you can have binary tree without pointers and all this stuff! Just by knowing how far ahead you need to look into array.

en.wikipedia.org/wiki/Smoothso

0

If you have a fediverse account, you can quote this note from your own instance. Search https://f.cz/users/xChaos/statuses/116024856775368956 on your instance and quote it. (Note that quoting is not supported in Mastodon.)