Subject: Re: [boost] [review] Last day for formal review for Sort library
From: Thijs (M.A.) van den Berg (thijs_at_[hidden])
Date: 2014-11-19 08:36:06
> 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.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk