Abstract
A priority queue transforms an input permutationσ of some set of sizen into an output permutationτ. It is shown that the number of such pairs (σ, τ) is (n + 1)n−1. Some related enumerative and algorithmic questions are also considered.
Similar content being viewed by others
References
D. E. Knuth:Sorting and Searching, The Art of Computer Programming Vol. 3, Addison-Wesley, (Reading, Massachusetts), 1973.
J. Riordan:An Introduction to Combinatorial Analysis, Wiley (New York) 1968.
Author information
Authors and Affiliations
Additional information
Supported by the National Science and Engineering Research Council of Canada under Grant A4219.
Rights and permissions
About this article
Cite this article
Atkinson, M.D., Thiyagarajah, M. The permutational power of a priority queue. BIT 33, 1–6 (1993). https://doi.org/10.1007/BF01990338
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01990338