NEW
Font size
S
M
L
XL
WorksheetsBubble Sort
Total questions: 13
Worksheet time: 13mins
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.
The process keeps repeating until there are no swaps in a pass.
a)
Bubble sort
b)
Insertion sort
3.
Efficient way to check if a list is already in order.
a)
Bubble sort
b)
Insertion sort
4.
Inefficient way to sort a list.
a)
Bubble sort
b)
Insertion sort
5.
Takes each item in turn and puts it in the right place using the first item in the list as a starting point.
a)
Bubble sort
b)
Insertion sort
6.
Starts by looking at the second item and compares it to all items before it in order to insert it in the right place.
a)
Bubble sort
b)
Insertion sort
7.
Repeats the process for the rest of the items until the last item has been inserted in the correct place.
a)
Bubble sort
b)
Insertion sort
8.
Very quick to add items in an already ordered list
a)
Bubble sort
b)
Insertion sort
9.
Good for small lists.
a)
Bubble sort
b)
Insertion sort
c)
Bubble sort and insertion sort
10.
Doesn’t use much memory.
a)
Bubble sort
b)
Insertion sort
c)
Bubble sort and insertion sort
11.
Does not cope well with very large lists.
a)
Bubble sort
b)
Insertion sort
c)
Bubble sort and insertion sort
12.
Speed of sort depends on how unordered the list is.
a)
Bubble sort
b)
Insertion sort
c)
Bubble sort and insertion sort
13.
Which type of sort algorithm is this?
a)
Bubble
b)
Merge
c)
Insertion
Reset
