Hello. I will prepared Boost's list of improvements. I can realize it. Maybe, some algorithms I only can't find in Boost. And i think, that if i will implement algorithms from this list, it's will be great. Improvement list for Boost.Algorithm Boost.Algorithm(String) 1) Manacker's Algorithm: finding all palindromes in string O(N). 2) Different algortihms based on suffix arrays and suffix trees: Boost.Algorithm(Numbers) 1) Checking for number's simplicity by BPSW test. O(logN). 2) Effective factorization algorithms: Po, Po-1, Bents algo, Po-Monte-Carlo, Ferms algo. 3) Longest increasing subsequence Boost. Container 1) Modifications of queue and stack for searching min/max element with O(1). Maybe, I forgot something. -- Best regards, Zaitsev Alexander