Portal de Periódicos da CAPES

Evaluation of permutation algorithms

1978; Oxford University Press; Volume: 21; Issue: 4 Linguagem: Inglês

10.1093/comjnl/21.4.296

1460-2067

M. Roy,

Coding theory and cryptography

Six non-recursive algorithms which appear to be the best in respect of the permutation sequences they generate, have been considered for evaluation. Since the machine/compiler used has significant effect on the permutation algorithms, in this paper a different approach has been taken instead of the usual timing experiments. We have obtained the number of times certain constructs would be obeyed in terms of formulae related to n, the number of marks. A comparison based on these formulae shows that Ives' algorithm is the best of all.