A Study on the Runtime Test of Priority Queues


The KIPS Transactions:PartA, Vol. 17, No. 4, pp. 167-172, Aug. 2010
10.3745/KIPSTA.2010.17.4.167,   PDF Download:

Abstract

This paper proposes a set of runtime test models for priority queues and shows the runtime test results based on the proposed test models for the representative priority queues: the traditional heap, post-order heap, and pairing heap. Among these heaps, the traditional heap is the worst in time complexity analyzed. But, according to our experimental results based on the test models proposed, it is shown that the slowest one is the pairing heap that utilizes pointers and the fastest one is the traditional heap. For the two implicit heaps, these results are in contrary to the fact that the post-order heap is better than the traditional heap in time complexity analyzed.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. J. Jung, "A Study on the Runtime Test of Priority Queues," The KIPS Transactions:PartA, vol. 17, no. 4, pp. 167-172, 2010. DOI: 10.3745/KIPSTA.2010.17.4.167.

[ACM Style]
Hae Jae Jung. 2010. A Study on the Runtime Test of Priority Queues. The KIPS Transactions:PartA, 17, 4, (2010), 167-172. DOI: 10.3745/KIPSTA.2010.17.4.167.