Xref: utzoo comp.theory:573 sci.math:10649
Path: utzoo!attcan!uunet!samsung!brutus.cs.uiuc.edu!wuarchive!psuvax1!rutgers!aramis.rutgers.edu!paul.rutgers.edu!straits.rutgers.edu!majidi
From: majidi@straits.rutgers.edu (Masoud Majidi)
Newsgroups: comp.theory,sci.math
Subject: efficient algorithm for generating permuations
Keywords: permutations
Message-ID: <Apr.13.10.59.00.1990.217@straits.rutgers.edu>
Date: 13 Apr 90 14:59:05 GMT
Organization: Rutgers Univ., New Brunswick, N.J.
Lines: 14


I am looking for an efficient algorithm to solve the following
problem:

Is there an easily computable function which defines a bijection from
numbers 1..n! to permuations of 1..n

I can easily write a function that generates all the permuations but I
don't know of any algorithm which would give a permutation without
generating exponentially many permutations.

I would appreciate any help.

Masoud Majidi(majidi@paul.rutgers.edu)