Merge sort | Starter Quiz | Oak National Academy

'A more efficient version of bubble sort uses a variable to flag when a swap was made during a single pass'

• False

• True

'The insertion sort algorithm copies the value to be inserted in a variable at the end of each pass'

• False

• True

'During a pass of an insertion sort, elements in the sorted part of the list are copied into the next position, to make space for the value to be inserted'

• False

• True

Two improvements to the bubble sort algorithm are reducing the number of comparisons after each pass, and stopping once no swaps are made during a single pass.

• False

• True

"Bubble sort compares items next to each other in the list and swaps them if they are in the wrong order."

• False

• True

"Insertion sort compares an item from the unsorted sublist with the items in the sorted sublist and places it in the correct position."

• False

• True

"Bubble sort is good at sorting large collections of unordered data."

• False

• True

"Bubble sort can be really fast at sorting data that is nearly in order."

• False

• True

"Insertion sort is usually slower to execute than bubble sort on large, unordered data sets."

• False

• True