@user1130176 Not in the average case, no. O(log(n)) behavior from a putative hash table would suggest a broken or misapplied implementation. You may be thinking of some other structure also commonly used to implement associative arrays -- e.g. some form of tree.
↧