In addition to a pathfinding visualizer, I also created a sorting visualizer after taking CS 61B at UC Berkeley. The visualizer currently features six comparison-based algorithms (Selection Sort, Bubble Sort, Heap Sort, Merge Sort, Insertion Sort, and Quick Sort) and two radix sorts (LSD Radix Sort and MSD Radix Sort). This project was created in conjunction with my personal portfolio and uses Node.js, Bootstrap, and Javascript. The full Github repository can be found here.