This is the third post in an article series about MIT's lecture course "Introduction to Algorithms." In this post I will review lectures four and five, which are on the topic of sorting. The previous post covered a lecture on "Divide and Conquer" algorithm design technique and its applications. Lecture four is devoted entirely to a single sorting algorithm which uses this technique. The algorithm
![MIT's Introduction to Algorithms, Lectures 4 and 5: Sorting](https://cdn-ak-scissors.b.st-hatena.com/image/square/deedb67dac356f5b6b3e505320e371d9688b51b1/height=288;version=1;width=512/https%3A%2F%2Fcatonmat.net%2Fimages%2Fcatonmat-preview-image.png)