Re: Randomisation for ensuring nlogn complexity in quicksort

Поиск
Список
Период
Сортировка
От Peter Geoghegan
Тема Re: Randomisation for ensuring nlogn complexity in quicksort
Дата
Msg-id CAM3SWZQchK_p8yBerKJgnz2tYvWYr1+C6=q6-fexarCKcNLuhA@mail.gmail.com
обсуждение исходный текст
Ответ на Re: Randomisation for ensuring nlogn complexity in quicksort  (Atri Sharma <atri.jiit@gmail.com>)
Ответы Re: Randomisation for ensuring nlogn complexity in quicksort
Список pgsql-hackers
On Tue, Jul 2, 2013 at 5:04 AM, Atri Sharma <atri.jiit@gmail.com> wrote:
>> I think if you'll try it you'll find that we perform quite well on
>> data sets of this kind - and if you read the code you'll see why.
>
> Right, let me read the code again from that viewpoint.

In my opinion, it would be worthwhile reading the original Bentley and
McIlroy paper [1] and using what you learned to write a patch that
adds comments throughout the canonical qsort_arg, and perhaps the
other variants.

[1] http://www.enseignement.polytechnique.fr/informatique/profs/Luc.Maranget/421/09/bentley93engineering.pdf
-- 
Peter Geoghegan



В списке pgsql-hackers по дате отправления:

Предыдущее
От: Fabien COELHO
Дата:
Сообщение: Re: New regression test time
Следующее
От: Tom Lane
Дата:
Сообщение: Re: Custom gucs visibility