A new algorithm for generation of permutations

A new algorithm for generating permutations is presented, that generates the next permutation by reversing a certain suffix of its predecessor. The average size of this suffix is less thane 2.8. It is shown how to find the position of a given permutation and how to construct the permutation of a given position, where the position refers to the order in which the permutations are generated, and is also new.On leave from the Department of Computer Science, Technion, Haifa, Israel. This work was supported by NSF grant MCS-8302391.