Date: Mon, 18 Apr 2016 13:02:06 -0400 From: Ryan Stone <rysto32@gmail.com> To: Hans Petter Selasky <hps@selasky.org> Cc: Ed Schouten <ed@nuxi.nl>, Aleksander Alekseev <afiskon@devzen.ru>, FreeBSD Current <freebsd-current@freebsd.org> Subject: Re: qsort() documentation Message-ID: <CAFMmRNyQRrZhSgJSRPTkMP2%2BpyzBs_FPOHZRxN5R-r%2BDa99=uw@mail.gmail.com> In-Reply-To: <5715079B.9010408@selasky.org> References: <5714C86A.8050204@selasky.org> <20160418151639.634d571d@fujitsu> <5714DC98.7090208@selasky.org> <CABh_MKmE=p0Uq=p-zAD8i8AiWvTKDyeviviOE_piZVK%2BzHsbxA@mail.gmail.com> <5715079B.9010408@selasky.org>
next in thread | previous in thread | raw e-mail | index | archive | help
On Mon, Apr 18, 2016 at 12:13 PM, Hans Petter Selasky <hps@selasky.org> wrote: > Did anyone try to generate such a fiendish set of data, and see how > quadratic the FreeBSD's qsort() becomes? > Not me, but it has been done: http://calmerthanyouare.org/2014/06/11/algorithmic-complexity-attacks-and-libc-qsort.html
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?CAFMmRNyQRrZhSgJSRPTkMP2%2BpyzBs_FPOHZRxN5R-r%2BDa99=uw>