Computer Science

a set of step-by-step instructions to solve a problem

a tool used to track the values of variables and the flow of execution in an algorithm or program, step by step

Comparing searching algorithms

In this unit pupils will have opportunities to analyse, interpret, modify, and implement a range of searching and sorting algorithms. They will have the opportunity to compare the features and efficiency of these algorithms and make suggestions about the most suitable algorithm for a given task.

Searching and sorting algorithms

Compare the first item in the list to the target value.

Repeat until the target value is found or the list ends.

Stop searching when the target value is found.

Arrange the steps of a linear search in the correct order:

Compare the midpoint with the target item.

Adjust the range based on the comparison.

Stop when the midpoint matches the target.

to track the values of variables during execution

Which searching algorithm is more complex to write?

Which of these is true about linear search?

What is the name of the algorithm that checks each item in a list one by one until the desired item is found?

It works on both sorted and unsorted lists.

What does binary search do with the data set at each step?

What must be true about a list for binary search to work?

Which of these is an example of a sorted list?

How many comparisons does binary search make in the best-case scenario?

Starter Quiz