Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
M. C. Er · The Computer Journal · 1987
This paper presents an implementation of an efficient algorithm for generating all permutations of n marks in a lexicographic order. This algorithm is more efficient than Irving's algorithm in terms of both time and space.