| From: | "Dann Corbit" <DCorbit(at)connx(dot)com> |
|---|---|
| To: | "Tom Lane" <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | "Qingqing Zhou" <zhouqq(at)cs(dot)toronto(dot)edu>, "Luke Lonergan" <llonergan(at)greenplum(dot)com>, "Neil Conway" <neilc(at)samurai(dot)com>, "Bruce Momjian" <pgman(at)candle(dot)pha(dot)pa(dot)us>, <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Which qsort is used |
| Date: | 2005-12-13 19:53:13 |
| Message-ID: | D425483C2C5C9F49B5B7A41F8944154757D368@postal.corporate.connx.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
The test is O(n)
> -----Original Message-----
> From: Tom Lane [mailto:tgl(at)sss(dot)pgh(dot)pa(dot)us]
> Sent: Tuesday, December 13, 2005 10:51 AM
> To: Dann Corbit
> Cc: Qingqing Zhou; Luke Lonergan; Neil Conway; Bruce Momjian; pgsql-
> hackers(at)postgresql(dot)org
> Subject: Re: [HACKERS] Which qsort is used
>
> "Dann Corbit" <DCorbit(at)connx(dot)com> writes:
> > Here is a sort template (that can very easily be turned into a C
> > routine).
>
> Right offhand I'd guess this to be a loser on not-quite-sorted input,
> because the tests it makes to try to prove the input is already sorted
> can add significant overhead before failing.
>
> regards, tom lane
| From | Date | Subject | |
|---|---|---|---|
| Next Message | kbforge | 2005-12-13 20:09:52 | New release: - kbforge 1.20 Free desktop search application with PGSQL database option |
| Previous Message | Michael Paesold | 2005-12-13 19:51:17 | Re: Regression test horology failure |