Unit 2.1 Searching & Sorting Algorithms MCQs L3-5

Which of the following is not a sorting algorithm? (1-2) 

• Bubble
• Insertion
• Binary
• Merge

Which sorting algorithm is described by: moving through a list repeatedly, swapping elements that are in the wrong order. (1-2) 

• 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. (1-2) 

• Merge
• Bubble
• Insertion
• None of the above

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. (1-2) 

• Merge
• Bubble
• Insertion
• None of the above

What is the first action in an insertion sort? (4-5) 

• Make a new list 
• Mark the rst item as the ordered list 
• Compare the rst and second elements 
• Put the rst element in the correct place 

The following two lists are to be merged, which element first goes into the new merged list (4-5)
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. (9) 

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

Which sorting algorithm needs to go through the list repeatedly? (4-5) 

• Merge
• Bubble
• Insertion
• None of them do

Which sorting algorithm splits a list of items into individual lists. (1-2) 

• Merge
• Bubble
• Insertion
• None of them do

Which sorting algorithm takes an item from the list, and puts it in the correct place in a sorted list? (4-5) 

• Merge
• Bubble
• Insertion
• None of them do