GCSE Computer Science 9-1: Sorting Algorithms

Which of these is not a sorting algorithm?

• Bubble

• Insertion

• Merge

• Binary

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

• Merge

• Bubble

• Insertion

• None of these

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

• Bubble

• Merge

• Insertion

• None of these

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.

• Bubble

• Insertion

• Merge

• None of these

What is the first action in an insertion sort?

• Make a new list

• Mark the first item in an ordered list

• Compare the first and second elements

• Put the first element in the correct place

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 needs to go through the list repeatedly?

• Merge

• Bubble

• Insertion

• None of these

Which sorting algorithm splits a list of items into individual lists?

• Merge

• Bubble

• Insertion

• None of these

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 these