2.1.3 Lesson 1 Interactive Quiz

Looks through each item in a list in turn until it finds the item being searched for.

• Binary Search

• Linear Search

Can only work on a sorted list.

• Binary Search

• Linear Search

Is not a very efficient algorithm and can be time-consuming for large lists.

• Binary Search

• Linear Search

Finds the midpoint of a list and compares it to the searched item.

• Binary Search

• Linear Search

During this search the list is halved at every pass.

• Binary Search

• Linear Search

When using this search on a list of 1000 items, the maximum number of checks is 10.

• Binary Search

• Linear Search

The worst-case scenario for this search is that it could perform as many checks as there are items in the list.

• Binary Search

• Linear Search

Uses a ‘divide and conquer’ algorithm.

• Binary Search

• Linear Search

An organisation with millions of customers would prefer to use this search.

• Binary Search

• Linear Search

Is the simplest type of searching algorithm.

• Binary Search

• Linear Search