Q: Insertion Sort Algorithm GCSE

Which description best describes an insertion sort algorithm?

True or False: The ‘Insertion Sort’ algorithm makes use of the principles of ‘Divide and Conquer’.

Consider the data set [5, 6, 2, 4]. What will the order of the data set be the moment the insertion sort algorithm reaches the 4th item?

True or False: An Insertion Sort is considered inefficient when compared to most other sorting algorithms.

The following array is partially sorted. The double bars represent the sort marker. How many comparisons and swaps are needed to sort the next number. [1 3 4 8 9 || 5 2]

What operation does the Insertion Sort use to move numbers from the unsorted section to the sorted section of the list?

Consider the following lists of partially sorted numbers. The double bars represent the sort marker.
How many comparisons and swaps are needed to sort the next number. [1 3 4 5 8 9 || 2]

Consider an array of elements “array = [5,4,3,2,1]” , what are the steps of insertions done while doing an insertion sort on the array?

What is the name of this sorting algorithm?

What is the name of this sorting algorithm?