← Back to context Comment by bufferoverflow 8 years ago Average O(1), worst case O(n)So worse than a B-tree or a Red-black tree for the worst case. 1 comment bufferoverflow Reply ant6n 8 years ago "Average O(1)" is an oxymoron. Big Oh is about the worst case. The only thing that makes sense is "Amortized O(1)", but I believe its possible to create access cases where hash tables are slower.
ant6n 8 years ago "Average O(1)" is an oxymoron. Big Oh is about the worst case. The only thing that makes sense is "Amortized O(1)", but I believe its possible to create access cases where hash tables are slower.
"Average O(1)" is an oxymoron. Big Oh is about the worst case. The only thing that makes sense is "Amortized O(1)", but I believe its possible to create access cases where hash tables are slower.