3 ms·
It depends on the hash table. Eg, in the D programming language if there is a collision instead of an array it uses a red-black tree. This makes it effective
by proverbialbunny 7y ago
It depends on the hash table. Eg, in the D programming language if there is a collision instead of an array it uses a red-black tree.
This makes it effective O(1) but worse case O(log n).
- denormalfloat 7y agoJava does something similar, decaying its HashMap into a binary tree after enough collisions.