bcraig added a comment.
Those are interesting (and useful) results... but they don't look like they
came from the same algorithms.bench.cpp that I'm looking at...
That being said, the benchmark there only does 1k elements at a time, and
doesn't have the worst case for quick sort like yours does. Adding to the
upstream algorithms.bench.cpp seems valuable.
cfe-commits mailing list