Description
Sorting is a fundamental concept in computer science and is essential for many applications.
This course will teach you through detailed animations how the most important sorting algorithms work and how to implement them in Python. By the end of this course, you will have an excellent understanding of the six popular sorting algorithms: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort and Heap Sort.
We will start in the first section with an introduction to sorting, the Big O notation, and a rough overview over the master theorem.
