diff options
| author | Tom Lane <tgl@sss.pgh.pa.us> | 2015-03-15 23:22:03 -0400 |
|---|---|---|
| committer | Tom Lane <tgl@sss.pgh.pa.us> | 2015-03-15 23:22:03 -0400 |
| commit | 904e8b627c2547e93112080aac9381bbf39e8e99 (patch) | |
| tree | 46e87fab125cc7403df0b940350c88420253bc8e /src/backend/executor/nodeIndexscan.c | |
| parent | 837eb0846190bef65575b642a0ee8a3b3fedbafe (diff) | |
Replace insertion sort in contrib/intarray with qsort().
It's all very well to claim that a simplistic sort is fast in easy
cases, but O(N^2) in the worst case is not good ... especially if the
worst case is as easy to hit as "descending order input". Replace that
bit with our standard qsort.
Per bug #12866 from Maksym Boguk. Back-patch to all active branches.
Diffstat (limited to 'src/backend/executor/nodeIndexscan.c')
0 files changed, 0 insertions, 0 deletions