How does binary search reduce the search space at each step?

Mediumdsabinary-search

By comparing the target against the middle element and eliminating half the remaining possibilitiesCorrect answer
By checking every single element one at a time from the start
By randomly guessing an index each time
By sorting the array again at every step

Show answer & explanation

Correct answer: A. By comparing the target against the middle element and eliminating half the remaining possibilities

Explanation

Binary search compares the target against the middle element and eliminates half of the remaining search range at each step.

Practise 3 questions on this topic

Take Sorting & Searching — Timed Test (3 questions) — scored instantly, explanation for every question, no login.

Mediumdsabinary-search

By comparing the target against the middle element and eliminating half the remaining possibilitiesCorrect answer
By checking every single element one at a time from the start
By randomly guessing an index each time
By sorting the array again at every step

Show answer & explanation

Correct answer: A. By comparing the target against the middle element and eliminating half the remaining possibilities

Explanation

Binary search compares the target against the middle element and eliminates half of the remaining search range at each step.

Practise 3 questions on this topic

Take Sorting & Searching — Timed Test (3 questions) — scored instantly, explanation for every question, no login.

Related questions