title: Optimizing qsort
body: <p>I've been on a search for the fastest algorithm out there to sort 1,000,000 integers. So far, surprisingly, C's built in qsort function seems to be the fastest out of anything that I've tried (I've tested pre sorted, reverse sorted, and random input files). On average, I get about .07 seconds for pre and reverse sorted and .2 seconds for random. </p>
  
  <p>How can I optimize it to run even faster? Are there any quick tricks? I know that C++'s std sort is faster, but that can't be used in C... I've attached my code.</p>
  
  <pre><code>int compare(const void *x, const void *y){   
     return ( *(int*)x &gt;= *(int*)y );
  }
  
  qsort(list, 1000000, sizeof(int), compare);
  </code></pre>