2.3 - Sorting Algorithms

Which of the following best describes the bubble sort?

• Adjacent items are compared and swapped if they are out of order

• Each item is compared to every other item from the start until its place is found

• Items in one list are compared to items in another list to create a new list

• Items are compared to a pivot

Which of the following best describes the insertion sort?

• Adjacent items are compared and swapped if they are out of order

• Each item is compared to every other item from the start until its place is found

• Items in one list are compared to items in another list to create a new list

• Items are compared to a pivot

Which of the following best describes the merge sort?

• Adjacent items are compared and swapped if they are out of order

• Each item is compared to every other item from the start until its place is found

• Items in one list are compared to items in another list to create a new list

• Items are compared to a pivot

Which of the following best describes the quicksort?

• Adjacent items are compared and swapped if they are out of order

• Each item is compared to every other item from the start until its place is found

• Items in one list are compared to items in another list to create a new list

• Items are compared to a pivot

A bubble sort uses ...

• A nested iteration

• Either a nested iteration or recursion

An insertion sort uses ...

• A nested iteration

• Either a nested iteration or recursion

A merge sort uses ...

• A nested iteration

• Either a nested iteration or recursion

A quicksort uses ...

• A nested iteration

• Either a nested iteration or recursion

Bubble sort is considered as ...

• Slow

• Fast

Insertion sort is considered as ...

• Slow

• Fast