WorksheetsYear 9 - Bubble Sort
Total questions: 8
Worksheet time: 6mins
Name
Class
Date
1.
Compares pairs of items and swaps them if they are in the wrong order. Each pair in the list is checked.
a)
Bubble sort
b)
Insertion sort
2.
Inefficient way to sort a list.
a)
Bubble sort
b)
Insertion sort
3.
Which type of sort algorithm is this?
a)
Bubble
b)
Merge
c)
Insertion
4.
A bubble sort goes through each pair in a list and swaps them if not in order.
a)
True
b)
False
5.
Why does a bubble sort do a final pass even when the data is in the correct order?
a)
To save the data
b)
It does not recognise that the data is in order until the final pass requires no changes
c)
It needs to do this to put the data back in to a list
6.
Which of the following is an advantage of a bubble sort?
a)
It is a very small and simple computer program
b)
It takes a very long time to run
c)
It is very quick
7.
Which of the following is an advantage of a bubble sort?
a)
It is a very small and simple computer program
b)
It takes a very long time to run
c)
It is very quick
8.
How many passes are required to sort a list with 5 elements?
a)
5
b)
4
c)
10
d)
2
100 %
