| From: | "Jonah H(dot) Harris" <jonah(dot)harris(at)gmail(dot)com> |
|---|---|
| To: | "Tom Lane" <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | pgsql-hackers(at)postgresql(dot)org, "Jerry Sievers" <jerry(at)jerrysievers(dot)com> |
| Subject: | Re: qsort, once again |
| Date: | 2006-03-16 19:43:17 |
| Message-ID: | 36e682920603161143wd9f5c56qdd9235dfe55bcd87@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On 3/16/06, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
>
> I'm wondering what the authors were expecting the insertion sort to
> handle exactly. Does anyone have a copy of the paper that's referenced
> in the code comment?
>
> /*
> * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
> */
Yes, I have it somewhere, let me dig it up for ya.
--
Jonah H. Harris, Database Internals Architect
EnterpriseDB Corporation
732.331.1324
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Simon Riggs | 2006-03-16 19:43:22 | Re: BETWEEN optimizer problems with single-value |
| Previous Message | Alvaro Herrera | 2006-03-16 19:41:52 | Re: BETWEEN optimizer problems with single-value |