On Sat, Mar 9, 2013 at 10:32 AM, Dann Corbit <dcor...@connx.com> wrote: > There is no such thing as a quicksort that never goes quadratic. It was > formally proven
The median of medians selection of the pivot gives you O(n*log(n)). -- greg -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
