Boost C++ Libraries

...one of the most highly regarded and expertly designed C++ library projects in the world. Herb Sutter and Andrei Alexandrescu, C++ Coding Standards

This is the documentation for an old version of Boost. Click here to view this page for the latest version.
PrevUpHomeNext

Rationale

Radix-based sorting allows the data to be divided up into more than 2 pieces per iteration, and for cache-friendly versions, it normally cuts the data up into around a thousand pieces per iteration. This allows many fewer iterations to be used to complete sorting the data, enabling performance superior to the 𝑶(N*log(N)) comparison-based sorting limit.


PrevUpHomeNext