title: Fastest way to sort 10 numbers? (numbers are 32 bit)
body: <p>I'm solving a problem and it involves sorting 10 numbers (int32) very quickly. My application needs to sort 10 numbers millions of times as fast as possible. I'm sampling a data set of billions of elements and every time I need to pick 10 numbers out of it (simplified) and sort them (and make conclusions from the sorted 10 element list).</p>
  <p>Currently I'm using <a href="https://en.wikipedia.org/wiki/Insertion_sort" rel="nofollow noreferrer">insertion sort</a>, but I imagine I could implement a very fast custom sorting algorithm for my specific problem of 10 numbers which would beat insertion sort.</p>
  <p>How can I approach this problem?</p>