On Sat, Jul 12, 2014 at 09:34:28PM +1000, Bruce Evans wrote: > Run time: > C++ sort() was twice as slow as qsort() for sorting 1 million dummy > users in the allocation tests. About 8 seconds instead of 4, except > when compiled with -g -O0 it was 15 seconds instead of 4.
I find that claim strange and not reproducable. In my tests, std::sort tends to be significant faster than qsort. Attached is a small test program that for me is twice as fast for sorting integers... Joerg _______________________________________________ svn-src-all@freebsd.org mailing list http://lists.freebsd.org/mailman/listinfo/svn-src-all To unsubscribe, send any mail to "svn-src-all-unsubscr...@freebsd.org"
