论文信息 - A note on constructing min-max heaps

A note on constructing min-max heaps

In this paper we show that to construct an implicit, double-ended priority queue organized as a min-max heap, 17/9n = 1.88 ...n comparisons suffice in the worst case (neglectng lower order terms). The algorithm improves the previously best known upper bound of 2.15 ...n comparisons.

[1] Patrik Eriksson,et al. Two New Algorithms for Constructing Min-Max Heaps , 1988, SWAT.

[2] Gaston H. Gonnet,et al. Handbook Of Algorithms And Data Structures , 1984 .

[3] Thomas Strothotte,et al. An Algorithm for Merging Heaps , 1985, Acta Informatica.

[4] Svante Carlsson,et al. The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues , 1987, Inf. Process. Lett..

[5] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[6] Jörg-Rüdiger Sack,et al. Bounds for min-max heaps , 1987, BIT.

[7] Svante Carlsson,et al. Average-case results on heapsort , 1987, BIT.

[8] Gaston H. Gonnet,et al. Heaps on Heaps , 1982, SIAM J. Comput..

[9] Bruce A. Reed,et al. Building Heaps Fast , 1989, J. Algorithms.

[10] Alan M. Frieze. On the Random Construction of Heaps , 1988, Inf. Process. Lett..

[11] Svante Carlsson,et al. A Note on the Construction of Data Structure "DEAP" , 1989, Inf. Process. Lett..

[12] Nicola Santoro,et al. Min-max heaps and generalized priority queues , 1986, CACM.