ATTENTION: You are viewing a page formatted for mobile devices; to view the full web page, click HERE.

Other Software > Developer's Corner

Sorting Algorithms Compared

<< < (2/2)

jgpaiva:
Hmm, I guess I could have posted a reply here instead of making a new topic, sorry :-[
-Ruffnekk (January 31, 2007, 01:33 PM)
--- End quote ---
I just posted here so that when people see this post, they'll have even more to look at ;)


On kenr's post, did anybody take a look at all the algorithms?
Some of them are just hilarious!! Here's a gem:
A PermSort Demonstration algorithm.  The PermSort algorithm is due
to Patrick Morin <http:www.scs.carleton.ca/~morin>.  The algorithm
works by trying every permutation until it finds one that's
sorted.  That's right, there are n! permutations and it takes O(n)
time to test each one, yielding an O(nn!) algorithm.  No hate mail
please.
--- End quote ---

Navigation

[0] Message Index

[*] Previous page

Go to full version