My failed attempt at creating a Bogosort algorithm. A bogosort is the most inefficient sorting algorithm- it shuffles the contents of a list randomly, then checks if it has sorted. If not, it reshuffles again. [I just wanted to see what would happen if I put it in a run without screen refresh block.]
I'm never working with lists again. -----------------------------------------------------------------------V-1.0 25/11/23 9:38pm If you're wondering, what's happening here is that instead of shuffling the contents of a list, it just randomizes the number which is why if you input something like 1 after an 8 it'll go to a ridiculous 896 or something. I will try and improve this to make it work. V-0.5 25/11/23 9:59pm I've made some... progress. Backwards. I made it so the list actually does shuffle itself when the (n1)th item on the list is larger than the (n2)th value. But for some reason the list randomly changes the numbers still, makes some values null, and doesn't even sort. Hence why, this version is called 0.5.
