good 1.
On Tue, Jul 13, 2010 at 2:56 AM, Amir hossein Shahriari <
amir.hossein.shahri...@gmail.com> wrote:
> make a bitwise trie
> since the height would be 32 (number of bits in an integer) u only need 32
> comparisons to find an element
>
> --
> You received this message because you are subscri
make a bitwise trie
since the height would be 32 (number of bits in an integer) u only need 32
comparisons to find an element
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To
How will you search an integer in just 32 comparisons in an unsorted
group of integers?
Devise a data structure for it.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubs
