This project is a website that visualizes the steps of a merge sort. The algorithm sorts columns of differing heights in ascending order. The initial order of the columns is random and can be randomized when the merge sort is not running. This program can help to understand the steps the merge sort algorithm takes.
Additionally, it is explained why the merge sort algorithm has a run time of O(nlog(n)) by creating and solving a recurrence relation.
Recording of the sorting animation on desktop
Screenshot on mobile showing the recurrence relation
- HTML / CSS
- JavaScript
- Bootstrap 4.5
- MathJax
- For displaying LaTeX in HTML
Find the program here or at the portfolio section of my website.
- No sorting algorithms other than merge sort
Licensed under the GNU General Public License v3.0