Constructing a Heap

Doberkat, Ernst-Erich GND

The well known algorithms due to Williams and to Floyd for the construction of a heap are considered with respect to their probabilistic properties. For Williams' algorithm the distribution of the heaps generated by this rnethod is investigated by means of a special kind of labeled trees. Floyd's algorithm is considered in greater detail, the expected numbers of interchanges, and comparisons respectively are derived and the leading terms of the asymptotic expansions are given.

Vorschau

Zitieren

Zitierform:

Doberkat, Ernst-Erich: Constructing a Heap. Hagen 1981. FernUniversität in Hagen.

Zugriffsstatistik

Gesamt

Volltextzugriffe:
Metadatenansicht:

12 Monate

Volltextzugriffe:
Metadatenansicht:

Rechte

Nutzung und Vervielfältigung:
Alle Rechte vorbehalten

Export

powered by MyCoRe