From: Aleksandar Donev <[log in to unmask]>
Date: Wednesday, 22 November 2006 8:42
>On 11/21/06, robin <[log in to unmask]> wrote:
>> It's not necessary to do a binary search.
>> On 13th I stated that it's done with table lookup.
>Yes, I understand that you use a table for a byte (table of 256). If you
>have 64 bits though you would first do "binary search" to find the byte
>where you need to look, and only then use table lookup. I am sure you don't
>want to make a table of 2^64 values :-)
A table of 256 is all that's required.
In any case, your problem requires only 32-bit integers, not 64.
And as I said, a binary search is not required.
If speed were specially important, a 16-bit table or 11-bit table
could be used, memory being such a small problem these days.