We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
Mention that GNU allocator is only on the C++17 branch.
Mention __gnu_cxx::bitmap_allocator.
Mention branchless traits potential optimizations for pdqsort
Typos + changed some explanations & complexities
Add a drop_merge_sorter to the library
Added a ska_sorter to the library
Document changes to insertion_sorter + notes about iterators invalidation.
Fix small note star.
Fix merge_sorter memory complexity and document container_aware_adapter-enhanced sorters.
Mention std::sort overloads for standard containers.
Formatting.
Reverse sorting for counting_sort.
Add a counting_sorter to the library.
spread_sorter performs n comparisons in the best case.
Projection support for spread_sorter.
Document sorter instantiations.
Add missing link.
Updatte default_sorter to reflect the latest changes.
default_sorter and spread_sorter are now full-fledged structs.
Merge std_stable_sorter into std_sorter.
Note about std_[stable_]sorter and proxy iterators.
Update merge_sorter complexity.
Every comparison sorter also handles projections.
Add a poplar_sorter to the library.
Add a merge_insertion_sorter to the library.
More restrictions for float_spread_sorter.
quick_sorter is O(n) when all values are equal.
Make quick_sorter memory usage fall to O(log n).
Every buffered sorter works with move-only types.
Quicksort now works with move-only types.