undefined

Binary Search (BS) uses divide and conquer strategy where problem is divided into smaller sub-problems and then each problem is solved independently. When we keep on dividing the subproblems into even smaller sub-problems, we may eventually reach a stage where no more division is possible. Those "atomic" smallest possible sub-problem (fractions) are solved. Given the following nodes in Table Q4a Table Q4a 17 36 3 6 65 53 29 25 55 31 | 12 8 47 42 14 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Perform Binary search for key 42 (show details of search method passes) How many comparison required to search for key 42? ii. What is the complexity of BS, the best and worst case