Projects

Last week I had a lot of fun visualizing various pathfinding algorithms so I decided to follow that up with a visualizer for another classic type of algorithm in CS, sorting algorithms. You can find the code for the final version here. Below, I will showcase what algorithms I covered and what the visualizations looked like, in this order: Bubble Sort Merge Sort Quick Sort Heap Sort In addition, the user can choose between 10 and 100 items to sort.

Over the weekend I was bored and at home and decided I wanted to do something fun and learn something new. Pathfinding algorithms are classic types of algorithms in CS, and make for good algorithms to try to visualize. I decided to do exactly this using the Pygame library in Python. You can find the code for the final version here. Below, I will showcase what algorithms I covered and what the visualizations looked like. Depth First Search Your browser does not support the video tag. Breadth First Search Your browser does not support the video tag. Greedy Best First Search Your browser does not support the video tag. A* (A star) algorithm Your browser does not support the video tag. Other Features Variable Speeds for Pathfinding Visualization Recursive Backtracking Maze Generation