Hashing O(1) lookup? Explained

This video explains the idea behind hashing and why data structures that use hashing produce o(1) looks ups. How these three search algorithms compare against each other in terms of time complexity or number of operations!

Linear Search O(n)
Binary Search O(log n)
HashSet O(1) or constant time

[pixel_yogi]

Hash function takes integer as input and will output memory address where that integer can be fetched from. Here by index I mean memory address.

[sanskartiwari]

Great video, I was looking for the answer of this specific question for so long. Finally found it

[closingtheloop]

Ok but I imagine there are specific hash functions needed for different key data types, and each of those will have their own limitations and overhead.