The order of the binary search algorithm is _______.
Options
- A. N
- B. N log n
- C. N2
- D. More than one of the above
- E. None of the above
E. None of the above
The time complexity (order) of the Binary Search algorithm is:
O(logn)
Binary search repeatedly divides the search space into two halves, which leads to logarithmic growth of steps.
Attempt Quiz Now:
BPSC Tre 4.0 DSA Practice Set