|
|
|
|
|
|
by tmd83
3608 days ago
|
|
|
When log(n) is within the word size the hashmap lookup for the most part is actually constant i.e., few specific machine operation. A generic log(n) algorithm still requires log(n) distinct operation for the most part however small that number is. |
|
|