Re: [boost] [review] Last day for formal review for Sort library

The algorithm provides a sort that is faster than O(n*log(n)).

Is it possible to specify the O() of the algorithm instead of only claiming that it's faster? I've read 1.8x speed up compared to std::sort and that made me think that it's also O(n*log(n)), but with a different constant in front. Specifying the exact O() is very informative, it tells you what to expect, how (the gap with std::sort) scales as a function of n.