News for hackers. Stuff that matters.
Re:Why databases use ordered indexes but programming uses ha... by proverbialbunny on Monday December 09, 2019 @11:47PM (#21749670)
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).

Re:Why databases use ordered indexes but programming uses ha... by denormalfloat on Monday December 09, 2019 @11:50PM (#21749697)
Java does something similar, decaying its HashMap into a binary tree after enough collisions.