Quiz on Insertion Sort

What is the primary advantage of an insertion sort over a bubble sort?

• It is less complex and more efficient.

• It is more complex and less efficient.

• It is equally efficient.

• It is slower but simpler.

Answer explanation

The primary advantage of insertion sort over bubble sort is its efficiency, especially for partially sorted data. Insertion sort has a better average and worst-case time complexity, making it less complex and more efficient overall.

Which sorting algorithm is more efficient for large data sets?

• Bubble sort

• Insertion sort

• Merge sort

• Selection sort

Answer explanation

Merge sort is more efficient for large data sets due to its O(n log n) time complexity, compared to O(n^2) for bubble, insertion, and selection sorts. It efficiently handles large volumes of data by dividing and conquering.

What does an insertion sort compare when organising a list?

• Only the largest value in the list

• All values simultaneously

• Values in turn, starting with the second value

• The first and last values in the list

Answer explanation

Insertion sort compares values in turn, starting with the second value. It takes each element and places it in the correct position relative to the already sorted portion of the list.

What happens if the current value in an insertion sort is greater than the value to its left?

• The current value is moved to the right.

• The current value is removed from the list.

• The values are swapped.

• No changes are made.

Answer explanation

In insertion sort, if the current value is greater than the value to its left, it remains in its position. Therefore, no changes are made, as the current value is already in the correct order relative to its left neighbor.

What happens if the current value in an insertion sort is less than the value to its left?

• The current value is removed from the list.

• The current value is moved to the right.

• The values are swapped once.

• The current value is repeatedly moved left.

Answer explanation

In insertion sort, if the current value is less than the value to its left, it is repeatedly moved left until it finds its correct position, ensuring the list remains sorted.

What is the first step in sorting the list [12, 14, 13, 11] using insertion sort?

• Compare 12 and 11

• Compare 13 and 11

• Compare 14 and 13

• Compare 12 and 14

Answer explanation

In insertion sort, we start by considering the first element (12) as sorted. The first step is to compare the next element (14) with the sorted part. Thus, we compare 12 and 14 to determine their order.

What happens when 13 is compared to 14 in the list [12, 14, 13, 11]?

• The values are swapped.

• No changes are made.

• 13 is removed from the list.

• 13 is moved to the right.

Answer explanation

When comparing 13 to 14 in the list [12, 14, 13, 11], 13 is less than 14, so they are swapped to maintain order. Thus, the correct answer is that the values are swapped.

What happens when 11 is compared to 14 in the list [12, 13, 14, 11]?

• 11 is removed from the list.

• No changes are made.

• 11 is moved to the right.

• The values are swapped.

Answer explanation

When comparing 11 to 14 in the list [12, 13, 14, 11], 11 is less than 14, so it is swapped with 14 to maintain order. Thus, the correct answer is that the values are swapped.

What happens when 11 is compared to 13 in the list [12, 11, 13, 14]?

• 11 is moved to the right.

• 11 is removed from the list.

• The values are swapped.

• No changes are made.

Answer explanation

When comparing 11 to 13 in the list [12, 11, 13, 14], 11 is less than 13, so they are swapped to maintain order. Thus, the correct answer is that the values are swapped.

What happens when 11 is compared to 12 in the list [11, 12, 13, 14]?

• No changes are made.

• 11 is moved to the right.

• 11 is removed from the list.

• The values are swapped.

Answer explanation

When comparing 11 to 12 in the list [11, 12, 13, 14], 11 is less than 12, so they are swapped to maintain order. Thus, the correct answer is that the values are swapped.