This is a sorting algorithm visualization project. It consists of a set of sorting algorithms that are applied to a set of lines of increasing length which are initially shuffled. The program then selects random colors and a random algorithm, and applies the sort visually. The program tracks and displays access and write operations, as well as the delay between steps and the current algorithm. Find the source code in my GitHub.
This is a visualization of the A* maze solving algorithm. It creates a randomly generated maze of increasing size, and applies the algorithm to solve it. It displays the maze width current width, as well as the number of traversed nodes. After solving, it presents the shortest path as green squares. Find the source code in my GitHub.