Best case lower bounds for heapsort.
Analýza zložitosti algoritmov triedenia hromady (heapsort). Dôkaz toho, že spodné ohraničenie počtu porovnaní n log n platí pre množinu týchto algoritmov, vrátane Williams-Floydovho algoritmu, Carlssonovho lineárneho algoritmu zdola nahor, algoritmu binárneho vsúvania, ako i pre všetky algoritmy zho...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Autres auteurs: | |
| Format: | Chapitre de livre |
| Langue: | anglais |
| Sujets: | |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires: Best case lower bounds for heapsort.
- <A> lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal.
- Lower bounds on externalities in sunspot models
- Computational aspects of a branch and bound algorithm for quadratic zero-one programming.
- Efficient interative algorithms for bounding the inverse of a matrix.
- Fiscal multipliers and the zero lower bound
- Taxonomy of foresight methods and bounded rationality restrictions