UTpaper

Free mock tests & test series

Question 146

The worst-case time complexity of binary search on n sorted elements is:

  1. AO(n log n)
  2. BO(n)
  3. CO(1)
  4. DO(log n)
Show answerHide answer

Correct answer: (D) O(log n)

Explanation

Each step halves the search space.

From DSSSB TGT Computer Science Full Mock Test 1

This is question 146 of DSSSB TGT Computer Science Full Mock Test 1. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.