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
For positive integers, the fastest sort is known as abacus sort- it's O(n)
If you only have a very few items, then it's unlikely that you will notice any performance difference from choosing any particular algorithm.