Binary Search can be categorized into which of the following?
A. Brute Force technique
B. Divide and conquer
C. Greedy algorithm
D. Dynamic programming
Answer:B
Binary Search can be categorized into which of the following?
A. Brute Force technique B. Divide and conquer C. Greedy algorithm D. Dynamic programming
Explanation: Since ‘mid’ is calculated for every iteration or recursion, we are diving the array into half and then try to solve the problem.