Fastest sorting algorithm for a specific situation
Posted
by luvieere
on Stack Overflow
See other posts from Stack Overflow
or by luvieere
Published on 2010-06-08T14:11:04Z
Indexed on
2010/06/08
16:42 UTC
Read the original article
Hit count: 422
What is the fastest sorting algorithm for a large number (tens of thousands) of groups of 9 positive double precision values, where each group must be sorted individually? So it's got to sort fast a small number of possibly repeated double precision values, many times in a row. The values are in the [0..1] interval. I don't care about space complexity or stability, just about speed.
© Stack Overflow or respective owner