An algorithm by @LOLDERWORKS that is inspired by quicksort, but ended up behaving like a combination of Pancake Sort, Slow Sort, and Stooge Sort. Worst case: ???? Average case: n^4 Best case: ????
@LOLDERWORKS I completely copied the code, the only thing replaced is the graphics. See the original project https://scratch.mit.edu/projects/1188654032/ Also if you are wondering why I am releasing so many projects at once its because I'm working on them during my free time locally.
