title: What is the best sorting algorithm to sort an array of small integers?
body: <p>As per question title, if the array is of an odd length and the array elements are numbered 1 - 10. </p>
  
  <p>Example, </p>
  
  <blockquote>
    <p>3 6 8 1 3 7 7 9 4 1</p>
  </blockquote>
  
  <p>I was thinking of using <em>heapsort</em>? Since it is an array, <em>merge sort</em> and <em>insertion sort</em> requires shifting, and would not be so efficient.</p>