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

Correct Answer (Detailed Explanation is Below)

E. None of the above

Detailed Explanation

The time complexity (order) of the Binary Search algorithm is:

O(logn)O(\log n)

Binary search repeatedly divides the search space into two halves, which leads to logarithmic growth of steps.

OOps! You are currently offline.