mirror of
https://github.com/postgres/postgres.git
synced 2026-06-23 17:11:43 -04:00
8582ae7aab
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.