This project is meant to be a tutorial for Clement Mihailescu's Sorting Visualizer project. Everything related to the tutorial (i.e., all the code that I, Clement, wrote) is located under ...

The merge sort is popular for two reasons: 1) its worst case is O(n log n), and 2) it has a property known as stable. Like all sorting algorithms, it has downsides. Here the downside requiring O(n) ...