Re: qsort, once again

Tom Lane <tgl@sss.pgh.pa.us>

From: Tom Lane <tgl@sss.pgh.pa.us>

To: Darcy Buskermolen <darcy@wavefire.com>

Cc: pgsql-hackers@postgresql.org, "Dann Corbit" <DCorbit@connx.com>, "Jonah H. Harris" <jonah.harris@gmail.com>, "Jerry Sievers" <jerry@jerrysievers.com>

Date: 2006-03-16T23:48:09Z

Lists: pgsql-hackers

Darcy Buskermolen <darcy@wavefire.com> writes:
> On Thursday 16 March 2006 12:09, Tom Lane wrote:
>> So we still have a problem of software archaeology: who added the
>> insertion sort switch to the NetBSD version, and on what grounds?

> This is when that particular code was pushed in, as to why exactly, you'll 
> have to ask mycroft.
> http://cvsweb.netbsd.org/bsdweb.cgi/src/lib/libc/stdlib/qsort.c.diff?r1=1.3&r2=1.4&only_with_tag=MAIN

Interesting.  It looks to me like he replaced the former
vaguely-Knuth-based coding with B&M's code, but kept the insertion-
sort-after-no-swap special case that was in the previous code.  I'll
betcha he didn't test to see whether this was actually such a great
idea ...

			regards, tom lane