2.3.3 average time complexities of different sorting algorithms

Question 1

Merge sort

Answer 1

O(nlog(n)) but requires more space for the merging process

Question 2

Quick sort

Answer 2

O(nlog(n)) (the fastest of all of the sorts)

Question 3

Insertion sort

Answer 3

O(n^2) but it becomes O(n) is almost already sorted

Question 4

Bubble sort

Answer 4

O(n^2) (the slowest out of all the sorting methods)