Gene, can you please explain by giving an example of 2-3 integers?
An example will really help the group here a lot.
On Jul 14, 10:43 pm, Gene wrote:
> On Jul 13, 3:46 am, Tech Id wrote:
>
> > Wont a bitwise trie be too memory intensive?
> > Storing an integer would need32nodes space and each n
On Jul 13, 3:46 am, Tech Id wrote:
> Wont a bitwise trie be too memory intensive?
> Storing an integer would need 32 nodes space and each node would need
> 3-integers space (data, left and right).
> So, if there are a million integers, we will need 32*3 = 96 million
> integers!
Great point. But i
If n is small, binary/linear search would be almost same as 32
comparisons.
--
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 unsubscribe from this group, send email to
algoge
@tech id
i think in this case we are just optimizing number of comparisons
if n is very large use tradational methods like binary or linear search
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@
Wont a bitwise trie be too memory intensive?
Storing an integer would need 32 nodes space and each node would need
3-integers space (data, left and right).
So, if there are a million integers, we will need 32*3 = 96 million
integers!
--
You received this message because you are subscribed to the
