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 siganakis on Thursday March 01, 2012 @12:23AM (#3651042)
My bad, I got that wrong.

The translated array should be:

1 0 2 3 0 3.

I am correcting the article now. For a non-rushed, accurate description please look at:

http://www.alexbowe.com/wavelet-trees

Edit: Got it wrong again... I guess this is why we have computers and debuggers!

[ Parent | on HN ]
Re:Building data structures that are smaller than an array a... by amatus on Thursday March 01, 2012 @11:55AM (#3652877)
Looks like you still have some bugs:

  rewritten data: 1 0 2 3 0 3
  first row     : 0 0 1 1 0 1
  group a       : 1 0     1
  group b       :     2 2   3
Group a and group b don't seem to match up with the data. Or I've misunderstood something.
[ Parent | on HN ]
Re:Building data structures that are smaller than an array a... by foamboarder on Friday March 02, 2012 @01:18PM (#3657630)
I'm in the same boat. siganakis?
[ Parent | on HN ]