Standard Sorting Algorithms Reading

Which of the following sorting algorithms is the simplest?

• Bubble sort

• Merge sort

• Insertion sort

• Quick sort

In a bubble sort, what is the term used for each run through the list from start to finish?

• Pass

• Cycle

• Round

• Loop

A merge sort uses a technique called ______ and conquer.

In an insertion sort, if a value is less than the value to its left, what happens?

• It is moved left until it meets a smaller value

• It is swapped with the value to its right

• It stays in its position

• It is moved to the end of the list

An insertion sort is more efficient than a ______ sort but less efficient than a merge sort.

During a merge sort, the list is repeatedly divided until all elements are ______ separated.