Comment on A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.
Only if there’s no collisions. With lots of collisions it’s far from constant.