Link Details

Link 865 thumbnail
User 1 avatar

By rick
via cg.scs.carleton.ca
Published: Jun 17 2006 / 20:05

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.
  • 26
  • 0
  • 3799
  • 12

Comments

Add your comment
User 201864 avatar

patcoston replied ago:

0 votes Vote down Vote up Reply

Most of these sort sites never mention the fastest site in the world ... no, it's not quicksort. This sort will beat quicksort every time.

for (x=0; x array2[array1[x]]++;

You're a geek ... you figure it out. It has a name but I don't remember it at the moment.

User 201864 avatar

patcoston replied ago:

0 votes Vote down Vote up Reply

forgot to use code tag. This is what you should be seeing.

[code lang="java"]

for (x=0; x

User 201864 avatar

patcoston replied ago:

0 votes Vote down Vote up Reply

Trying again.

for (x=0; x<n; x++)
array2[array1[x]]++

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Java EE7
Written by: Andrew Lee Rubinger
Featured Refcardz: Top Refcardz:
  1. Design Patterns
  2. OO JS
  3. Cont. Delivery
  4. CI Patterns
  5. CI Tools
  1. Spring Integration
  2. Git
  3. Regex
  4. Java
  5. REST