Home | Blog | Software | Reviews and Features | Forum | Help | Donate | About us
topbanner_forum
  *

avatar image

Welcome, Guest. Please login or register.
Did you miss your activation email?

Login with username, password and session length
  • September 01, 2015, 09:28:45 PM
  • Proudly celebrating 10 years online.
  • Donate now to become a lifetime supporting member of the site and get a non-expiring license key for all of our programs.
  • donate

Author Topic: Sorting Algorithms Compared  (Read 4427 times)

KenR

  • Super
  • Blogger
  • Joined in 2006
  • ***
  • Posts: 826
    • View Profile
    • Donate to Member
Sorting Algorithms Compared
« 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
Kenneth P. Reeder, Ph.D.
Clinical Psychologist
Jacksonville, North Carolina  28546
« Last Edit: January 04, 2007, 08:44:19 PM by KenR »

CodeTRUCKER

  • Supporting Member
  • Joined in 2006
  • **
  • Posts: 1,032
    • View Profile
    • Read more about this member.
    • Donate to Member
Re: Sorting Algorithms Compared
« Reply #1 on: January 04, 2007, 11:24:21 PM »
Very nice find.  I learned something today! :)
« Last Edit: October 19, 2010, 04:10:38 PM by CodeTRUCKER »

jgpaiva

  • Global Moderator
  • Joined in 2006
  • *****
  • Posts: 4,727
    • View Profile
    • Read more about this member.
    • Donate to Member
Re: Sorting Algorithms Compared
« 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...va/sorting-demo.html
Screenshot-07_01_05,09_31_38.pngSorting Algorithms Compared

jgpaiva

  • Global Moderator
  • Joined in 2006
  • *****
  • Posts: 4,727
    • View Profile
    • Read more about this member.
    • Donate to Member
Re: Sorting Algorithms Compared
« Reply #3 on: January 31, 2007, 01:32:05 PM »
Here's another finding by ruffnekk: Sorting Contest

Ruffnekk

  • Honorary Member
  • Joined in 2006
  • **
  • Posts: 332
  • Uhm yeah...
    • View Profile
    • RuffNekk's Crypto Pages
    • Donate to Member
Re: Sorting Algorithms Compared
« 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 :-[
Regards,
RuffNekk

Programming is an art form that fights back.

jgpaiva

  • Global Moderator
  • Joined in 2006
  • *****
  • Posts: 4,727
    • View Profile
    • Read more about this member.
    • Donate to Member
Re: Sorting Algorithms Compared
« 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 :-[
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:
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.