Chances are if you have ever written code you’ve tried sorting a set of data. There are many different sorting algorithms, each has its own advantages and limitations but, with most programming languages having built-in tim/quick sort it’s unlikely that most people will ever have to implement a sorting algorithm (outside of the classroom). In this project I created a colorful visualizer with adjustable parameters to illustrate the effectiveness of each algorithm.