Mini-Sized

Jump to navigation Jump to search
Revision as of 17 July 2013 at 16:56.
The highlighted comment was created in this revision.

Mini-Sized

Could a kd-tree be made less than one thousand bytes?

    Sheldor (talk)15:59, 17 July 2013

    I'm not sure, if you leave out the complicated stuff it loses its speed. Perhaps with the help of built-in structures like Java's PriorityQueue it might be possible. Impress us!

      Skilgannon (talk)17:56, 17 July 2013