Which algorithmic technique does Fibonacci search use?
Brute force
Divide and Conquer
Greedy Technique
Backtracking
Correct Answer: B — Divide and Conquer
Explanation:
With every iteration, we divide the given array into two sub arrays(not necessarily equal).
