| From: | "Dann Corbit" <DCorbit(at)connx(dot)com> |
|---|---|
| To: | "Dann Corbit" <DCorbit(at)connx(dot)com>, "Josh Burdick" <jburdick(at)gradient(dot)cis(dot)upenn(dot)edu> |
| Cc: | <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: finding medians |
| Date: | 2002-05-30 21:03:26 |
| Message-ID: | D90A5A6C612A39408103E6ECDD77B82920CEE0@voyager.corporate.connx.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Here is a program written in C that demonstrates 2 median/selection
computation techniques:
ACM Algorithm 727 (implementation by Sherif Hashem)
QuickSelect (implemented by me).
Since it is written in C, it would be useful to PostgreSQL project
without any fanfare.
ftp://cap.connx.com/pub/chess-engines/new-approach/727.c
The ACM agorithm 727 is an approximation.
The QuickSelect result is exact.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Katherine Ward | 2002-05-30 21:33:50 | Small changes to facilitate Win32 port |
| Previous Message | Dann Corbit | 2002-05-30 20:48:28 | Re: finding medians |