Abstract
In a recent article Fike describes an elegant new algorithm for generating permutations and gives two procedures implementing this algorithm. In this paper we give improved versions with comparative measurements on two machine/compiler systems. The results show that on one of the systems a recursive procedure is the fastest.

This publication has 0 references indexed in Scilit: