{"push_id":602748378,"size":1,"distinct_size":1,"ref":"refs/heads/REL9_1_STABLE","head":"9288645b596efde3a58e267896b38f8f089a2920","before":"043fe5c5a62a71455162b322c5ac819716702b02","commits":[{"sha":"9288645b596efde3a58e267896b38f8f089a2920","author":{"email":"ffeaa947aef224da9ba99b6a18bdd74288df0e3e@sss.pgh.pa.us","name":"Tom Lane"},"message":"Replace insertion sort in contrib/intarray with qsort().\n\nIt's all very well to claim that a simplistic sort is fast in easy\ncases, but O(N^2) in the worst case is not good ... especially if the\nworst case is as easy to hit as \"descending order input\".  Replace that\nbit with our standard qsort.\n\nPer bug #12866 from Maksym Boguk.  Back-patch to all active branches.","distinct":true,"url":"https://api.github.com/repos/postgres/postgres/commits/9288645b596efde3a58e267896b38f8f089a2920"}]}