Sorting Algorithms Compared

[KenR]

This is a great site. It allows you to directly compare the performance of numerous sort algorithms. You can pick 3 at a time, start them, and watch them sort - they way they sort as well as how long it takes. Code for the sorting algorithms is also presented. HIGHLY recommended!

This page has visualizations of some comparison based sorting algorithms. The quick sort, bubble sort and cocktail shaker sort are due to the good folks at Sun Microsystems. The original SortItem applet was written by James Gosling.

http://cg.scs.carlet...~morin/misc/sortalg/

from www.stumbleupon.com

[CodeTRUCKER]

Very nice find.  I learned something today!

[jgpaiva]

Here's another site i used when i was studying algorithms in school:
http://www.cs.ubc.ca...va/sorting-demo.html
Sorting Algorithms Compared

[jgpaiva]

Here's another finding by ruffnekk: Sorting Contest

[Ruffnekk]

Hmm, I guess I could have posted a reply here instead of making a new topic, sorry

[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)

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.