[Solved] Why is binary search faster than linear search on sorted lists? — Ans: Because it divides the list and eliminates half each step | Intro to Computing

Intro to Computing - How Files and Folders Organize Data

Why is binary search faster than linear search on sorted lists?

ABecause it divides the list and eliminates half each step

BBecause it checks every element one by one

CBecause it sorts the list first

DBecause it uses random guessing

Step-by-Step Solution

Solution:

Step 1: Understand binary search process
Binary search splits the sorted list and discards half where the item cannot be, reducing search steps.
Step 2: Compare with linear search
Linear search checks every element, which is slower for large lists.
Final Answer:
Because it divides the list and eliminates half each step -> Option A
Quick Check:
Binary search halves search space each step [OK]

Quick Trick: Binary search halves search space each step [OK]

Common Mistakes:

Master "How Files and Folders Organize Data" in Intro to Computing

9 interactive learning modes - each teaches the same concept differently

More Intro to Computing Quizzes

Why is binary search faster than linear search on sorted lists?