2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/162517An algorithm is presented for unranking permutations in transposition order: Given a seed s\in N, the algorithm produces a permutation P(s) that differs from the permutation P(s+1) by the transposition of two elements.Combinatoricstext