Unsorted Arrays vs Binary Search
1. What is the recurrence relation for the binary search?
2. In a linked list, which algorithm can be used to search for an element?
3. Let us consider a sorted array of length N. What would be the best time complexity of the algorithm to find a pair of numbers such that absolute difference between them is equal to p? (i.e (x,y) where |x-y| = p)
4. Binary search is better than linear search for a static sorted array.
5. In an array, what would be the time complexity to find the closest upper bound of a given number?