"></a></span><a class="link" href="bibliography.html#sort.bibliography.original_spreadsort">Original
      Spreadsort</a>
    </h5>
<p>
      The algorithm that __integer_sort was originally based on. __integer_sort uses
      a smaller number of key bits at a time for better cache efficiency than the
      method described in the paper. The importance of cache efficiency grew as CPU
      clock speeds increased while main memory latency stagnated. See Steven J. Ross,
      The Spreadsort High-performance G