i was on my laptop XD and omg I discovered this really fast algrorthm (i can never spell that word!! LOL!) i call it bogosort LMAO cuz its BOGO (aka CRAZY) AWESUM! xDDD
its even faster than quicksort!!
$ time ./quicksort
real 5m3.238s
user 1m1.020s
sys 0m0.000s
$ time ./bogosort
real 0m0.000s
user 0m0.000s
sys 0m0.000s
OMFG!!! anyone who says quicksort is teh best is a fukin liar LOL! xDDD OMG
$ time ./sleep
real -10m7.419s
user -4m2.508s
sys 0m0.000s
I used sleep(-1) and array is solved even before running the program.
Name:
Anonymous2011-06-22 12:20
/prog/'s Tenth Rule
Any sufficiently complicated sleepsort algorithm contains an ad hoc, informally-specified, bug-ridden, slow implementation of half of bogosort.
>>6
Your sleepsort is not OPTIMIZED! The program finishes before the array is sorted. Please optimize your algorithms for the benefit of all /prog/ users. Thank you.