9 Mar
2009
9 Mar
'09
9:50 p.m.
we are alreadt ~3.7 times better. I suspect tbb::parallel_sort doesn't use a std::sort as base algorithm.
They actually use std::sort. Why should they use something else? :) I wonder if we could do better with a median of 3 pivot selection.
for(int count = ::GetTickCount(); count != target; count = ::GetTickCount());
This is a trivial spin to make sure the tasks eat up some CPU for the desired amount of ms.
May be you can do the test, I work on cygwin.
I will do it, yes, but not today. ;) -- EA