Welcome Guest.   Make a donation to an author on the site August 22, 2014, 08:39:03 PM  *

Please login or register.
Or did you miss your validation email?


Login with username and password (forgot your password?)
Why not become a lifetime supporting member of the site with a one-time donation of any amount? Your donation entitles you to a ton of additional benefits, including access to exclusive discounts and downloads, the ability to enter monthly free software drawings, and a single non-expiring license key for all of our programs.


You must sign up here before you can post and access some areas of the site. Registration is totally free and confidential.
 
Learn about the DonationCoder.com microdonation system (DonationCredits).
   
   Forum Home   Thread Marks Chat! Downloads Search Login Register  
Pages: [1]   Go Down
  Reply  |  New Topic  |  Print  
Author Topic: Sorting Algorithms Compared  (Read 3915 times)
KenR
Super
Blogger
***
Posts: 825


View Profile Give some DonationCredits to this forum member
« on: January 04, 2007, 08:42:17 PM »

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!

Quote
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.



from www.stumbleupon.com
« Last Edit: January 04, 2007, 08:44:19 PM by KenR » Logged

Kenneth P. Reeder, Ph.D.
Clinical Psychologist
Jacksonville, North Carolina  28546
CodeTRUCKER
Supporting Member
**
Posts: 1,028



Bush Flying... where I'd rather be.

see users location on a map View Profile Read user's biography. Give some DonationCredits to this forum member
« Reply #1 on: January 04, 2007, 11:24:21 PM »

Very nice find.  I learned something today! smiley
« Last Edit: October 19, 2010, 04:10:38 PM by CodeTRUCKER » Logged

I applaud those that refuse to commit "intellectual suicide."

Truth, unlike opinion, tradition, etc. will always be able to stand on its own.  Truth is not a static, but a living entity and will perpetually impart life; therefore, any "truth" that does not or can not impart life can not be Truth.

I am persuaded the only reason bad men have succeeded is not because good men have done nothing, but that good men did not do enough.

An Open Letter to My Friends


Notice: - Unless stated otherwise, I receive no compensation for anything I post here.
jgpaiva
Global Moderator
*****
Posts: 4,710



Artificial Idiocy

see users location on a map View Profile WWW Read user's biography. Give some DonationCredits to this forum member
« Reply #2 on: January 05, 2007, 03:32:03 AM »

Here's another site i used when i was studying algorithms in school:
http://www.cs.ubc.ca/~harrison/Java/sorting-demo.html

Logged

jgpaiva
Global Moderator
*****
Posts: 4,710



Artificial Idiocy

see users location on a map View Profile WWW Read user's biography. Give some DonationCredits to this forum member
« Reply #3 on: January 31, 2007, 01:32:05 PM »

Here's another finding by ruffnekk: Sorting Contest
Logged

Ruffnekk
Honorary Member
**
Posts: 331



Uhm yeah...

View Profile WWW Give some DonationCredits to this forum member
« Reply #4 on: January 31, 2007, 01:33:32 PM »

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

Regards,
RuffNekk

Programming is an art form that fights back.
jgpaiva
Global Moderator
*****
Posts: 4,710



Artificial Idiocy

see users location on a map View Profile WWW Read user's biography. Give some DonationCredits to this forum member
« Reply #5 on: January 31, 2007, 01:52:23 PM »

Hmm, I guess I could have posted a reply here instead of making a new topic, sorry embarassed
I just posted here so that when people see this post, they'll have even more to look at Wink


On kenr's post, did anybody take a look at all the algorithms?
Some of them are just hilarious!! Here's a gem:
Quote
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.
Logged

Pages: [1]   Go Up
  Reply  |  New Topic  |  Print  
 
Jump to:  
   Forum Home   Thread Marks Chat! Downloads Search Login Register  

DonationCoder.com | About Us
DonationCoder.com Forum | Powered by SMF
[ Page time: 0.04s | Server load: 0.21 ]