Computer Science

a sorting algorithm that repeatedly compares pairs of values within a list and swaps them if they are out of order

Bubble sort

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

Which sorting algorithm repeatedly compares and swaps adjacent items in a list?

compares adjacent items and swaps them if needed

divides the list into halves and sorts each half

searches for a specific value in the list

tracks the number of passes in a trace table

What is the purpose of swapping items in the bubble sort algorithm?

How many passes are required to complete a bubble sort?

swap items if they are in the wrong order

repeat until the end of the list is reached

Arrange the steps to perform one pass of a bubble sort:

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

Which searching algorithm is simpler to code?

to track the values of variables and the flow of execution

It splits the data into halves to search efficiently.

Which of the following is a characteristic of a binary search?

searches sequentially through each element

Exit Quiz