Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Searching, Sorting and Hashing Searching
Consider an interpolation search which is an improvement over binary search where the values in a sorted array are uniformly distributed. In interpolation search construction of new data points take place at different locations according to the value of the key being searched. Find the time complexity of interpolation search.
1
O(log n)
2
O(n)
3
O(n log n)
4
O(log(log n))