bit manipulation - Complexity of search operation on a nedtrie (bitwise trie) -


i heard nedtries , decided try implementing them, bothers me complexity of search operation; can't stand why supposed fast.

from understood, expected complexity of search operation should o(m/2) m size of key in bits. if compare complexity of search operation in traditional binary tree, get: log2(n) >= m/2

let's key 32bits long: log2(n) >= 16 <=> n >= 65536

so nedtries should faster binary trees starting 65536 items. however, author claim faster binary tree, either assumption on complexity wrong or computations performed @ each step of search vastly faster in nedtrie.

so, it?

if have smaller trees, can use smaller keys!


Comments

Popular posts from this blog

Add email recipient to all new Trac tickets -

400 Bad Request on Apache/PHP AddHandler wrapper -

php - Change action and image src url's with jQuery -