So I was doing some research on this topic, and found some basic tutorials to help code the quicksort algorithm, and made some fun stuff to help display the data and performance with some FPS stuff. I now understand how the quicksort algorithm works, which is that you take a unsorted list and take a number from the list and compare it to all others and see which is smaller or bigger and do that with all numbers of the list which is like a pivot essentially.
If whatever I said abt the algorithm is wrong if you could help explain that would be helpful CONTROLS: Click the quicksort button for unstorted data and when you want it to sort, you click, hold, and then unclick anywhere on the screen but the button. If the performance is green and in one or the other place blue, then it works rly fast on your device. Red and yellow is a bit slow. Btw I'm back
