Date: Mon, 14 Jul 2014 21:23:22 +0200 From: Joerg Sonnenberger <joerg@britannica.bec.de> To: svn-src-all@freebsd.org Subject: Re: svn commit: r268566 - head/usr.bin/users Message-ID: <20140714192322.GA23366@britannica.bec.de> In-Reply-To: <20140712195452.N3279@besplex.bde.org> References: <201407120747.s6C7lpYE020200@svn.freebsd.org> <20140712195452.N3279@besplex.bde.org>
next in thread | previous in thread | raw e-mail | index | archive | help
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
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20140714192322.GA23366>