Really fast sort on semi sorted data

Question

5.00/5 (2 votes)

See more:

Does any body know of a really fast sort algorithm for semi sorted items in a list which would beat the internal QuickSort of a List<T> in the .net framework?

Posted 4-Jan-12 3:02am

Mehdi Gholam

Add a Solution

Comments

Sergey Alexandrovich Kryukov 4-Jan-12 12:55pm

Good question (my 5), but I think the answer would depend on the definition of semi-sorted. You see, different algorithms works with different speeds on different data sets. When the data is random (still it would need the description of randomness, such as average size, total number...) you can do comparison. As soon as you say, "semi-sorted", there are different ways of getting this random semi-sorted state -- and comparison of algorithms can be different for different ways. Isn't it logical?
--SA

Mehdi Gholam 4-Jan-12 13:04pm

I have an array of T (10000 items) which I sort then split in two. [ a new index I created for RaptorDB ] my profiler says about 20% of the time is in the quicksort routine, still twice the speed of b+tree.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Wendelius · Accepted Answer · 2012-01-04T09:33:00

Solution 1

Not saying which is fastest but you may find these interesting:
- A Comparison of Sorting Algorithms[^]
- Comparison of several sorting algorithms[^]
- The Fastest Sorting Algorithm?[^]

Posted 4-Jan-12 9:33am

Wendelius

Comments

Mehdi Gholam 5-Jan-12 8:20am

Thanks 5'ed, I have found TimSort which is promising...

Wendelius 5-Jan-12 15:38pm

Thanks, hopefully it performs better :)