Basic sorting algorithms written in python. The code is simple and easy to understand.
Check out the average Big-O complexities of the common sorting algorithms:
- Quicksort: O(n log(n))
- Mergesort: O(n log(n))
- Heapsort: O(n log(n))
- Bubble Sort: O(n^2)
- Insertion Sort: O(n^2)
- Selection Sort: O(n^2)