-
Implement betting OOP in the project so there are not so many lines of code repeated from one Sort method to another.
-
Convert the project to use the processing function
redraw()to not have to deal with the crazy way of rendering that me from 10 months ago doing.
This project was created as a way to get ready for my Data Structures and Algorithms class. The program can visualize three sorting algorithms as of now. These algorithms are Bubble, Insertion, and Selection sort.
- How Drawing Works in Processing
In processing the draw() function is called continuously after the setup() function is called once. This means that if a for loop is used in the draw() function everything is paused until the for loop is over. This is a problem if the goal is to show what the algorithms are doing in the for loops.
- How Drawing Works in Processing
The solution to this problem was to use if statements as pseudo for loops. While this is very easy for algorithms like bubble sort it gets much more complicated for algorithms like insertion sort.
Click image below for video:
Linkedin: https://www.linkedin.com/in/austin-heard/
Project Link: https://github.com/AustinHeard/Algorithm_Visualization