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.
