projects / users / heikki / postgres.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 7b8b8a4) | patch
Replace insertion sort in contrib/intarray with qsort().
authorTom Lane <tgl@sss.pgh.pa.us>
Mon, 16 Mar 2015 03:22:03 +0000 (23:22 -0400)
committerTom Lane <tgl@sss.pgh.pa.us>
Mon, 16 Mar 2015 03:22:03 +0000 (23:22 -0400)
commit8d1f239003d0245dda636dfa6cf0add13bee69d6
tree5fb7c3ec20ccdf05d56f393e48c24ce008f08197tree
parent7b8b8a43317e9e59eca8b511b714a0ab7da5f1cbcommit | 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.
contrib/intarray/_int_tool.c diff | blob | blame | history
Heikki's random PostgreSQL patches