Computer Science

a visual representation of an algorithm or program

Practice searching and sorting algorithms

Linear search

Binary search

Comparing searching algorithms

Bubble sort

Merge sort

Code sorting 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

What is the purpose of using a flowchart for searching and sorting algorithms?

What is the name of the symbol used to mark the start or end of a flowchart process?

What is the main advantage of binary search over linear search?

What is the purpose of sorting data before a search?

combine all parts into a fully sorted list

Arrange the steps of the merge sort algorithm in the correct order:

requires data to be sorted before it can work

uses symbols to represent the logic of an algorithm

Match the term to its correct description:

places each element in its correct position

moves the largest element to the correct position

check if the middle element matches the target

Which sorting algorithm is most efficient for small data sets?

place each element in its correct position

Which search algorithm checks each element in a list one by one to find a target?

Practice searching and sorting algorithms

Lesson outcome