This repo includes several sorting methods such as merge sort, quick sort, and etc.

Runtimes:

                 Average Case       Best Case     Worst Case    Space     Stable
        
Merge sort:        O(nlogn)         O(nlogn)       O(nlogn)      O(n)      Yes


Quick sort:        O(nlogn)         O(nlogn)       O(n^2)        O(1)       No


Selection sort:    O(n^2)            O(n^2)        O(n^2)        O(1)       No


Insertion sort:    O(n^2)            O(n)          O(n^2)        O(1)       Yes


Heap sort:         O(nlogn)         O(nlogn)       O(nlogn)      O(1)       No


Bubble sort:       O(n^2)            O(n)          O(n^2)        O(1)       Yes