Searching algorithm 2025

Teams > topic 1> Searching algorithms > Do now

Searching Algorithms

​

Linear Search

• Starts with the first item in the list

• checks if it's the target

• moves sequentially along the list

• until it finds the target OR reaches the end of the list

​

Multiple Choice

Which of the following statements best describes how the linear search algorithm works?

• It checks each item in the list one by one until it finds the target value.

• It divides the list into halves and checks the middle item first.

• It sorts the list before searching for the value.

• It skips every other item in the list.

Open Ended

Explain how a linear search works: (4 steps)

Dropdown

A linear search starts at the ​

Select answer

of a list. Checks the ​

Select answer

value with the ​

Select answer

If it's not the value it will move ​

Select answer

to the next item. It repeats this until the target is found OR it reaches the​

Select answer

of the list.

​

​

​

​1, 2, 3, 4, 5, 6, 8, 9, 10

​1, 2, 3, 4, 5, 6, 8, 9, 10

​https://www.bbc.co.uk/bitesize/guides/zm77xfr/revision/3

​

​

​

Open Ended

How does a binary search algorithm work?

Open Ended

How would a binary search work on this list searching for the number 7:

1, 2, 3, 5, 7, 8, 9, 10

Multiple Choice

Which searching algorithm requires the data to be in order?

• Linear Search
• Breadth-First Search
• Binary Search
• Depth-First Search

Multiple Choice

Which best describes a linear search algorithm?

• A linear search algorithm requires a sorted list to function.
• A linear search algorithm uses a binary tree structure.
• A linear search algorithm checks each element one by one.
• A linear search algorithm sorts the elements before searching.

Multiple Choice

Which of these best describes a binary search algorithm?

• A search algorithm that divides the search space in half each time.
• A search algorithm that uses a linear approach to find elements.
• A sorting algorithm that arranges data in ascending order.
• A search algorithm that checks each element one by one.

Categorize

Options (8)

Starts at the start of the list

Looks at the middle value of the list

List items need to be in order

List items can be in any order

The more items added to the list the longer the search will take

Inefficient on large lists.

Halves the list each time

Works efficiently on large lists

Organize these options into the right categories

Binary seach

Linear search

Teams >
Topic 1>
Searching Algorithms >
Activity 1