How do you change the amount of segments for each sorting algorithm?

[distay0xGit]

If there is a way to do that, then Bogo wouldn't be straining so much. [It's accessed the array 1.54B times, at 20,000x speed.]

[wingerse]

It's hardcoded to 1000 atm.

[distay0xGit]

I just realized that " hardcoded" means "you can literally change it at startup by changing a small amount of code in the main array and drawing thread".

[distay0xGit]

And also, another brief mention so I don't forget it later:
Array lengths cannot be changed.
Also, I do wish that the code could be optimized so that if the possibility that arrays can get their length changed, the code could run smoother on higher quantities of numbers.
Such as 1,048,576 numbers.