Skip to content

Latest commit

 

History

History
18 lines (13 loc) · 398 Bytes

README.md

File metadata and controls

18 lines (13 loc) · 398 Bytes

sorting_algorithms_py

Basic sorting algorithms written in python. The code is simple and easy to understand.

Average Complexities!

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)