WorksheetsSorting Algorithms
Total questions: 11
Worksheet time: 6mins
Name
Class
Date
1.
Which of the following is not a sorting algorithm?
a)
Bubble
b)
Insertion
c)
Binary
d)
Merge
2.
Which sorting algorithm is described by: moving through a list repeatedly, swapping elements that are in the wrong order.
a)
Merge
b)
Bubble
c)
Insertion
d)
None of the above
3.
Which sorting algorithm is described by: split a list into individual lists, then combine these, two lists at a time.
a)
Merge
b)
Bubble
c)
Insertion
d)
None of the above
4.
Which sorting algorithm is described by: take each item in turn, compare it to the items in the sorted list and place it in the ordered position in the sorted list.
a)
Merge
b)
Bubble
c)
Insertion
d)
None of the above
5.
What is the first action in an insertion sort?
a)
Make a new list
b)
Mark the first item as the ordered list
c)
Compare the first and second elements
d)
Put the first element in the correct place
6.
The list above is to be sorted using a bubble sort. What will the list look like after the first iteration through the list.
a)
6, 8, 1, 3, 12
b)
6, 12, 1, 8, 3
c)
1, 3, 6, 8, 12
d)
6, 8, 1, 12, 3
7.
Which sorting algorithm needs to go through the list repeatedly?
a)
Merge
b)
Bubble
c)
Insertion
d)
None of them do
8.
Which sorting algorithm splits a list of items into individual lists.
a)
Merge
b)
Bubble
c)
Insertion
d)
None of them do
9.
Which sorting algorithm takes an item from the list, and puts it in the correct place in a sorted list?
a)
Merge
b)
Bubble
c)
Insertion
d)
None of them do
10.
How does Bubble Sort compare to Insertion Sort and Merge Sort?
a)
It is more efficient
b)
It has the same efficiency
c)
It is less efficient
11.
When starting the Insertion Sort algorithm which side do we start from?
a)
The left hand side
b)
The right hand side
c)
Anywhere
100 %
