Searching Algorithms Questions Medium
The time complexity of interpolation search is O(log log n) on average, where n is the size of the array being searched. However, in the worst case scenario, the time complexity can be O(n), making it less efficient than other searching algorithms such as binary search.