Unsorted Arrays vs Binary Search
1. What is the prerequisite to perform Binary Search?
2. Binary Search is an example of _______ algorithm.
3. Let us assume an array [1,23,145,178,1203]. How many iterations are needed to find 23? [Assuming we are considering floor of values for floating point values, and index starting from 1]
4. Let us assume an array [11, 33, 145, 1294, 1356, 1450, 3300, 4500, 6000, 8000, 9000]. Let us search for 4500 using binary search. What would be the mid values at the second and third iteration respectively? [Assuming we are considering floor of values for floating point values, and index starting from 1]
5. What is the space complexity of binary search implemented using recursion?