What is the worst-case time complexity of Binary Search?
Difficulty: Medium
About this MCQ
This Medium Algorithms question asks: What is the worst-case time complexity of Binary Search? The correct choice is B. O(log n). Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.
Algorithms items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Algorithms so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.
Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Algorithms item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.
- A. O(n)
Why not A: “O(n)” does not fit this question. The answer is O(log n).
- B. O(log n) ✓
- C. O(n log n)
Why not C: “O(n log n)” does not fit this question. The answer is O(log n).
- D. O(1)
Why not D: “O(1)” does not fit this question. The answer is O(log n).
Correct answer
B. O(log n)
Explanation
O(log n) is the value that answers “What is the worst-case time complexity of Binary Search” (option B). Option A (O(n)) does not fit this question. Option C (O(n log n)) does not fit this question. Option D (O(1)) does not fit this question. For this Algorithms question, the accepted answer is O(log n).
Source: Algorithms Reference Guide
Tags: algorithms, binary search, complexity
Submitted by: MCQsHub Editorial
Related MCQs
- What does Binary search refer to?
- What is the name for a simple sorting algorithm that repeatedly swaps adjacent elements if they are in the wro...
- Which of the following best describes Bubble sort?
- Identify the correct concept described as: a divide-and-conquer sorting algorithm that splits the array, sorts...
- Merge sort is best defined as which of the following?
- A divide-and-conquer sorting algorithm that partitions elements around a pivot value. What is this concept cal...