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).