Re: Why do we still perform a check for pre-sorted input within qsort variants?

Поиск
Список
Период
Сортировка
От Dann Corbit
Тема Re: Why do we still perform a check for pre-sorted input within qsort variants?
Дата
Msg-id 87F42982BF2B434F831FCEF4C45FC33E5BD36A05@EXCHANGE.corporate.connx.com
обсуждение исходный текст
Ответ на Re: Why do we still perform a check for pre-sorted input within qsort variants?  (Dann Corbit <DCorbit@connx.com>)
Список pgsql-hackers
Дерево обсуждения 
"A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq"
By Eelis van der Weegen and James McKinna
Institute for Computing and Information Sciences
Radboud University Nijmegen
Heijendaalseweg 135, 6525 AJ Nijmegen, The Netherlands

Contains a formal proof, validated by machine logic, that quicksort is quadratic in the worst case and also a formal
proofof the average runtime efficiency.

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

Предыдущее
От: Dann Corbit
Дата:
Сообщение: Re: Why do we still perform a check for pre-sorted input within qsort variants?
Следующее
От: Greg Stark
Дата:
Сообщение: Re: Why do we still perform a check for pre-sorted input within qsort variants?