Computer Science

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

in sorting algorithms, efficiency refers to how effectively an algorithm uses resources (time and space) while sorting a list of data

Code sorting algorithms

Linear search

Binary search

Comparing searching algorithms

Bubble sort

Merge sort

Practice searching and 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

to optimise the efficiency of an algorithm

to record the state of variables and conditions during code execution

What is the purpose of a trace table in programming?

it is the most efficient sorting algorithm for large data sets

it compares adjacent elements and swaps them if needed

it inserts elements into their correct position one by one

Which of the following statements is true about bubble sort?

by using a variable to flag when a swap is made during a pass

by increasing the number of comparisons per pass

How can the performance of bubble sort be improved?

how effectively it uses resources such as time and space

how many lines of code the algorithm contains

What does the efficiency of a sorting algorithm refer to?

swap elements if they are in the wrong order

set a flag if a swap is made during the pass

Arrange the steps of the bubble sort algorithm with a flag in the correct order:

You have been given some playing cards that have not been sorted.
The cards are in the following order
4, 8, 5, 2, 9
State the order of the cards after the first pass of the bubble sort algorithm.

What is the main purpose of a sorting algorithm?

it divides the list into halves and sorts each half

it finds the smallest element and places it at the beginning

it repeatedly swaps adjacent elements if they are in the wrong order

Which of the following best describes the bubble sort algorithm?

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

repeatedly swaps adjacent elements to sort a list

Match the following terms with their definitions:

A {{}} is an error checking method that steps through each line of code in a program and records the state of the variables and conditions.

Sam wants to use the merge sort algorithm to sort the following scores from lowest to highest. Show the order of the items after the first merge.
250,120,95,101,80

Code sorting algorithms

Lesson outcome