DIVYA added a comment.
Link to algorithm.bench.cpp benchmark
Comment at: include/algorithm:4208
+ // Threshold(or depth limit) for introsort is taken to be 2*log2(size)
+ typedef typename iterator_traits<_RandomAccessIterator>::difference_type
> This comment says basically the same thing as the code. The comment would be
> more useful if it said why 2*log2(size) is used.
We tested the code with depth limit from log2(size) to 4*log2(size).It was
giving good performance around 2*log2(size).So the depth limit was fixed a this
cfe-commits mailing list