Self-Study - 61. OCR GCSE (J277) 2.1 Insertion sort

What is the main purpose of the insertion sort algorithm?

• To insert each item into its correct position in a data set one at a time.

• To sort data sets using a divide and conquer approach.

• To find the maximum value in a data set.

• To merge two sorted lists into one.

For what type of data sets is the insertion sort algorithm particularly useful?

• Large data sets

• Small data sets

• Data sets with negative numbers

• Data sets with only positive numbers

What is the advantage of using insertion sort on already sorted lists?

• It is faster than other algorithms.

• It requires less memory.

• It can easily insert new items into the list.

• It can handle large data sets efficiently.

In the video example, which breakfast cereal is placed at the bottom of the sorted list?

• Weetabix

• Sugar Puffs

• Cornflakes

• Crunchy Nut Clusters

What colour represents the sorted part of the list in the visual example?

• Blue

• Red

• Green

• Orange

What is the first step in the insertion sort algorithm as described in the video?

• Compare the first two items.

• Insert the first item into the sorted list.

• Move the largest item to the end.

• Swap the first and last items.

Which item is compared to Sugar Puffs in the first comparison step?

• Weetabix

• Crunchy Nut Clusters

• Fruit 'n' Fibre

• Cornflakes

What happens when an item is less than the item it is being compared to in the insertion sort?

• The item is removed from the list.

• The item is moved up one position.

• The item is left in its current position.

• The item is swapped with the next item.

What is the final step in the insertion sort process?

• Check if the list is sorted.

• Insert the last item into its correct position.

• Swap the first and last items.

• Reverse the list.

According to the GCSE specification, what must students be able to do with algorithms?

• Memorise the code for each algorithm.

• Understand the main steps and apply the algorithm to a data set.

• Write new algorithms from scratch.

• Use algorithms only in exams.