What is the primary advantage of binary search over linear search?

What is the primary advantage of binary search over linear search?

Step 1: Understand what linear search is. It checks each item one by one until it finds the target or reaches the end.
Step 2: Know that linear search has a time complexity of O(n), meaning if there are n items, it may check all n items in the worst case.
Step 3: Understand what binary search is. It only works on sorted lists and divides the list in half to find the target quickly.
Step 4: Know that binary search has a time complexity of O(log n), meaning it reduces the number of items to check significantly with each step.
Step 5: Compare the two: O(log n) is much faster than O(n) for large lists, making binary search more efficient.

No concepts available.