Comment by phkahler

Can I just settle for O(log n) lookup and forget about the theoretical O(1) and constant struggle to find the "best" hash function and data structure?