ISSN:
1572-9273
Keywords:
06A06
;
Priority queue
;
binary sequence
;
enumeration
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A priority queue transforms an input sequence σ into an output sequence τ which is a re-ordering of the sequence σ. The setR of all such related pairs is studied in the case that σ is a binary sequence. It is proved thatR is a partial order and that ¦R¦=c n+1, the (n+1)th Catalan number. An efficient (O(n 2)) algorithm is given for computing the number of outputs achievable from a given input.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01108706