NobleBlocks

Research indexJournal article

61.9 A permutation algorithm

Owen

The Mathematical Gazette1 Jun 1977

NobleIDark:/48914/w1/20260525/2B2B1B22DOI10.2307/3616417

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

Abstract

A computing colleague asked me recently if I could devise an algorithm for obtaining the ith permutation in an alphabetical list. Suppose that the n ! permutations of n distinct letters A, B, C,..., N are listed in alphabetical order. The problem is: Given i (where i = 1,2,..., n !), find the i th permutation.

Discussion

Citations

Topics

More

Suggest a correction or report