Match each sorting algorithm to its characteristic The term

Match each sorting algorithm to its characteristic. The term \"consistent\" means that the average, best, and worst case big-O runtime formulas are the same.

A consistent, log-linear, divide and conquer algorithm.

A less efficient quadratic average case algorithm.

A consistently quadratic algorithm.

A highly efficient quadratic average case algorithm.

A divide and conquer with quadratic worst case algorithm.

bubble sort

selection sort

insertion sort

merge sort

quicksort

The descriptions are on the left and the answers are on the right. They\'re not matched and need to be rearranged to be matched.

Solution

A

A consistent, log-linear, divide and conquer algorithm

4

merge sort

B

A less efficient quadratic average case algorithm.

1

bubble sort

C

A consistently quadratic algorithm.

2

selection sort

D

A highly efficient quadratic average case algorithm.

3

insertion sort

E

A divide and conquer with quadratic worst case algorithm.

5

quicksort

Explanation:

A: Merge sort is based on divide and conquer has the running time O(nlogn) in all cases so consistent and log linear

B. bubble sort gives us O(n²) running time in average case and O(n) in best case. So it is not consistent

It is less efficient than insertion sort.

C. Selection sort has the running time O(n²) in all cases. So consistently quadratic

D. Insertion Sort has the average case running time O(n²) . But in best case it gives   O(n) runningtime

E. Quick sort is based on divide and conquer approach. In worst case It run O(n^2) times.