News for hackers. Stuff that matters.

A comment on Building data structures that are smaller than an array and faster (in C). Parent comment

Re:Building data structures that are smaller than an array a... by gorset on Wednesday February 29, 2012 @11:43PM (#3650957)
You also get order with a wavelet tree. You can ask "Give me the absolute position for the 4th value 42 in the array". By using a wavelet tree with an index, you can answer that question in almost constant time.
[ Parent | on HN ]

There are no comments on this comment yet.