Re:Performance Improvements Using Judy Arrays
by aidenn0 on Wednesday May 01, 2013 @03:11PM
(#5640143)
Actually its O(w) and so are optimal hash-tables (since the hashing function must be O(w).
Interestingly enough you can consider hash tables and Tries to be O(log n) since in order to have N distinct keys, the maximum key length must be at least log(N).
Interestingly enough you can consider hash tables and Tries to be O(log n) since in order to have N distinct keys, the maximum key length must be at least log(N).