Which of the following is not a sorting algorithm?

• Bubble
• Insertion
• Binary
• Merge

Which sorting algorithm is described by moving through a list repeatedly, swapping elements that are in the wrong order?

• Merge
• Bubble
• Insertion
• None of the above

Which sorting algorithm is described by: split a list into individual lists, then combine these, two lists at a time.

• Merge
• Bubble
• Insertion
• None of the above

Which sorting algorithm is described by taking each item in turn, compare it to the items in the sorted list and place it in the ordered position in the sorted list?

• Merge
• Bubble
• Insertion
• None of the above

The following two lists are to be merged, which element first goes into the new merged list?
List 1
2  4  8  9
List 2
1  6  8  4

• 0
• 1
• 2
• 3

The following list is to be sorted using a bubble sort:
12  6  8  1  3
What will the list look like after the first iteration through the list?

• 6  8  1  3  12
• 6 12  1  8   3
• 1  3  6  8  12
• 6  8  1  12  3

Which sorting algorithm takes an item from the list, and puts it in the correct place in a sorted list?

• Merge
• Bubble
• Insertion
• None of them do

Identify the search algorithm 

• Random search 
• Binary search 
• Denary search 
• Next Item search 

 Identify the description of a linear search 

• Put the elements in order, check each item in turn 
• Put the elements in order, compare to the middle value, split the list in order and repeat 
• Elements do not need to be in order, check each item in turn 
• Elements do not need to be in order, compare to the middle value, split the list in order and repeat 

 Identify the description of a binary search 

• Put the elements in order, check each item in turn 
• Put the elements in order, compare to the middle value, split the list in order and repeat 
• Elements do not need to be in order, check each item in turn 
• Elements do not need to be in order, compare to the middle value, split the list in order and repeat