Hostname: page-component-745bb68f8f-d8cs5 Total loading time: 0 Render date: 2025-02-04T14:49:50.876Z Has data issue: false hasContentIssue false
  • English
  • Français

61.9 A permutation algorithm

Published online by Cambridge University Press:  22 September 2016

G. I. Owen
G. I. Owen*
Affiliation:
Physical Sciences Department, South London College, London SE27 0TX
Get access Rights & Permissions [Opens in a new window]

Extract

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 ith permutation.

Type
Notes
Information
The Mathematical Gazette , Volume 61 , Issue 416 , June 1977 , pp. 135 - 136
Copyright
Copyright © Mathematical Association 1977

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)