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
  • June 24, 2017, 09:08:37 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 Contest  (Read 2871 times)

Ruffnekk

  • Honorary Member
  • Joined in 2006
  • **
  • Posts: 332
    • View Profile
    • Donate to Member
Sorting Contest
« on: January 31, 2007, 01:20:56 PM »
I remember this earlier post by KenR about comparing sorting algorithms. I found another site that does the same.

Check out this Sorting Contest. Nice thing is you can click one button to start all sorting routines similtaneously.

Sorting.pngSorting Contest


Crush

  • Member
  • Joined in 2006
  • **
  • Posts: 399
    • View Profile
    • Donate to Member
Re: Sorting Contest
« Reply #1 on: January 31, 2007, 01:34:27 PM »
The fastest Sorting-Algorithm I know is the radix-sort. As a previous sort-function before quick-sort the speed should be pushed up several times in most cases. I used the radix-sort in a very old cruncher and the speed to find the same and nearest codes was incredible compared to others at his time (even if they used hash-algos).

f0dder

  • Charter Honorary Member
  • Joined in 2005
  • ***
  • Posts: 9,085
    • View Profile
    • Donate to Member
Re: Sorting Contest
« Reply #2 on: January 31, 2007, 03:39:18 PM »
Funny thing is how some people thing radix sort is only usable for integers, and some even think it's only usable for byte-sized integers specifically...

Hybrid algorithms are :-*

mouser

  • First Author
  • Administrator
  • Joined in 2005
  • *****
  • Posts: 37,130
    • View Profile
    • Donate to Member
Re: Sorting Contest
« Reply #3 on: January 31, 2007, 03:41:48 PM »
beautifull.