| From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
|---|---|
| To: | Darcy Buskermolen <darcy(at)wavefire(dot)com> |
| Cc: | pgsql-hackers(at)postgresql(dot)org, "Dann Corbit" <DCorbit(at)connx(dot)com>, "Jonah H(dot) Harris" <jonah(dot)harris(at)gmail(dot)com>, "Jerry Sievers" <jerry(at)jerrysievers(dot)com> |
| Subject: | Re: qsort, once again |
| Date: | 2006-03-16 23:48:09 |
| Message-ID: | 23198.1142552889@sss.pgh.pa.us |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Darcy Buskermolen <darcy(at)wavefire(dot)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
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Dann Corbit | 2006-03-17 00:42:20 | Re: qsort, once again |
| Previous Message | Darcy Buskermolen | 2006-03-16 23:41:24 | Re: qsort, once again |