Re: [boost] [library submission] smoothsort

Subject: Re: [boost] [library submission] smoothsort
From: Edouard A. (edouard_at_[hidden])
Date: 2008-12-16 13:11:01

> In case you are interesting in advanced search-algorithms as well,
> there is also a generic sequence searching template function in the 
> vault. (Algorithms/single_pass_search) This algorithm is more generic 
> than std::search (works with input-iterators) and has better worst case 
> complexity at the same time. 
> (See also http://www.codeproject.com/KB/stl/single_pass_search.aspx)

Maybe we should sort what's in the queue and group that into sub-libraries,
such as:

Boost.Algorithm.Search
Boost.Algorithm.Sort
Boost.Algorithm.Split (?)
...

Not doing this right now may quickly result in a vast catalogue of
heterogeneous routines, transforming Boost.Algorithm into
Boost.HereBeDragons.

-- 
EA