Generating alternating permutations lexicographically
A permutation π1 π2 ... πn is alternating if π1<π2>π3<π4 .... We present a constant average-time algorithm for generating all alternating permutations in lexicographic order. Ranking and unranking algorithms are also derived.
CR CategoriesF.2.2 G.2.1
Unable to display preview. Download preview PDF.