Year 10

Year 10

# Binary search

## Lesson details

### Key learning points

1. In this lesson, we will be introduced to binary search: the second searching algorithm we need to know about. We will go over the steps of carrying out a binary search and perform a binary search with playing cards and with a sample of data.

### Licence

This content is made available by Oak National Academy Limited and its partners and licensed under Oak’s terms & conditions (Collection 1), except where otherwise stated.

## Video

Share with pupils

## Worksheet

Share with pupils

## Starter quiz

Share with pupils

### 4 Questions

Q1.
What card would you need to search for, for the best-case scenario to occur?
10
7
8
9
Q2.
What card would you need to search for, for the worst-case scenario to occur?
10
6
7
9
Q3.
How many comparisons would it take to work out that a card wasn’t in the set of cards?
10
6
7
9
Q4.
When carrying out the linear search, does the data need to be ordered?
Yes

## Exit quiz

Share with pupils

### 4 Questions

Q1.
When carrying out the binary search, does the data need to be ordered?
No