Closed GoogleCodeExporter closed 8 years ago
[deleted comment]
Reposting again this time with the define above the include files :) Running
time differences are in milliseconds.
Here you can find a plot which demonstrates that for sequences of up to about
7000-8000 elements the legacy code outperforms Merrill's sort [1]. On the Y
axis you can see the difference in running times of both algorithms, on the X
axis you can see the number of elements. I am also attaching the code used for
benchmarking [2] which was heavily copy&pasted from thrusts front page.
[1]http://i56.tinypic.com/200bima.png
[2]http://paste.ideaslabs.com/show/1Cmu89eCVJ
Original comment by diman.to...@gmail.com
on 4 Mar 2011 at 2:53
This issue was closed by revision 7fe3bf56a132.
Original comment by wnbell
on 10 Jul 2011 at 4:12
Original issue reported on code.google.com by
wnbell
on 4 Mar 2011 at 2:24