2 ms·Hash lookup is O(1)by acjohnson55 9y agoHash lookup is O(1)learc83 9y agoWith a perfect hash function. But it's still going to be closer to O(1) than O(log n)