Sorting Algorithm Runtime

Question 1

Selection Sort

Answer 1

O(N^2)

Question 2

Insertion Sort

Answer 2

O(N^2)

Question 3

Shell Sort

Answer 3

O(N^1.5)

Question 4

Quick Sort

Answer 4

Average case and best case: O(NlogN) Fast Worst case: O(N^2)

Question 5

Merge Sort

Answer 5

Average, best, and worst case: O(NlogN) Fast

Question 6

Heap Sort

Answer 6

Best case: O(N) Worst and average case: O(NlogN) Fast

Question 7

Radix Sort

Answer 7

Average, worst, and best case: O(N) Fast