Sorting

Can't believe to get back this topic again. Many algorithm courses use sorting as an introduction to algorithm design paradigms and techniques and sample to analyze time and space complexity. Here we'll try to imitate the same approach. However, it hides away the development of these algorithms. By presenting it without struggles and motivations, an O(nlogn) algorithm loses some of its magic.

Roadmap

We will go over two iterative approaches first - bubble sort and insertion sort. Then we will look at two solutions using the divide and conquer paradigm. Lastly, we will discuss how to sort efficiently with the help from data structure.