What is the fastest sorting algorithm for a small number of integers?

Question

I am wondering what the fastest algorithm would be for this. I have 8 integers between 0 and 3000 and I need to sort them. Although there are only 8 integers, this operation w

Answer 1

Have you profiled your code to show that the sort is a bottleneck? If it isn't a bottleneck, then speeding it up won't buy you much. Sorting eight short integers is pretty fast.

In general, std::sort() will be faster than anything you can write, unless you are a real sorting guru.