It will be reviewed by the Boost community from September 22nd through October 1st, 2011. It is licensed under the Boost Software License, Version 1.0

The Boost.Algorithms library is a work in progress; it is not meant to be a complete set of general purpose algorithms for C++ programming; but rather a small collection of useful algorithms, and a structure for adding more over time.

The algorithms here fall into three basic categories:

1. Searching
   • Boyer-Moore Search
   • Boyer-Moore-Horspool Search
   • Knuth-Morris-Pratt search
2. Sequence properties
   • Tests to see if a sequence is ordered
   • Tests for the elements of a sequence
3. Miscellaneous
   • Constrain a value between two 'boundaries' (minmax)

TONGARI has been nice enough to put a copy of the generated documentation online

I have added a lot of the C++11 algorithms to the library. Check out:

• copy_if (and copy_while, copy_until)
• copy_n
• find_if_not
• iota
• is_partitioned
• is_permutation
• minmax
• minmax_element (satisfying the C++11 performance criteria)
• move (using ether std::move or boost::move, depending)
• partition_copy
• partition_point

The docs are still lagging, but coming along.