Re:A new fast hash table in response to Google’s new fast ha...
by ant6n on Thursday May 31, 2018 @03:35AM
(#17194628)
"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.
[ Parent
| on HN ]
There are no comments on this comment yet.