Searching Algorithms

Question 1

What is a linear search?

Answer 1

checks each item in a list one by one until it finds the one you’re looking for or reaches the end

Question 2

What is a binary search?

Answer 2

A binary search quickly finds an item by repeatedly dividing the list in half and checking the middle value. If the item is smaller, it searches the left half; if bigger, the right half. It keeps going until it finds the item or the list can’t be divided anymore.

Question 3

What is needed before using a binary search?

Answer 3

The list must be sorted in order (like from smallest to largest).

Question 4

Why is binary search more efficient than linear search?

Answer 4

Binary search skips over large parts of the list by dividing it in half each time, so it needs fewer steps to find an item.