So, I'm working on a project, and I need a deliberately inefficient sorting routine(don't ask). Basically, it needs to sort an array of 100 random positive integers. So, it needs to be able to sort 100 numbers of wildly varying sizes in a fairly reasonable amount of time(no more than say a few minutes) Apparently, that rules out a Bogosort, as it would take something like ~9.3x10^159 iterations
[mod edit: replaced with scientific notation](I think, I really don't know about big O notation), or, perhaps an infinite amount, depending on the quality of the c++ random number generator, and the much faster quantum bogosort isn't really feasable
so, any ideas? a deliberatly and interestingly inefficient sort that will sort 100 random numbers in a few minutes. I was looking through
this page, but it got a bit confusing. Or, maybe just a really obscure sort would do. Just as long as it's not something ordinary.
Thanks.
![Smile :)](./images/smilies/grayscale_smile.gif)