libboost-sort/1.78.0

The goal of the Boost Sort Library is provide to the users, the most modern and fast sorting algorithms.

This library provides stable and not stable sorting algorithms, in single thread and parallel versions.

These algorithms do not use any other library or utility. The parallel algorithms need a C++11 compliant compiler.

                  |       |                            |                               |                     |
Algorithm         |Stable |   Additional memory        |Best, average, and worst case  | Comparison method   |
------------------|-------|----------------------------|-------------------------------|---------------------|
spreadsort        |  no   |      key_length            | N, N sqrt(LogN),              | Hybrid radix sort   |
                  |       |                            | min(N logN, N key_length)     |                     |
pdqsort           |  no   |      Log N                 | N, N LogN, N LogN             | Comparison operator |
spinsort          |  yes  |      N / 2                 | N, N LogN, N LogN             | Comparison operator |
flat_stable_sort  |  yes  |size of the data / 256 + 8K | N, N LogN, N LogN             | Comparison operator |
                  |       |                            |                               |                     |