Hello everyone.
So through my journey of all these different algorithms of sorting, I came across quick sort. Which is pretty tight, does everything, very nice and everything, but I realized... quick sort's weakness... its weakness is a sorted list :P
I got my code written and everything on getting a unsorted data sorted, but how would I check to see if the data is already sorted, and I don't wanna print it out to check..
What if there is like 1million inputs of data... don't wanna read 1 million things :P.
Thanks ya'll
