Skip Navigation

The Computer Journal 1978 21(4):296-301; doi:10.1093/comjnl/21.4.296
© 1978 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Roy, M. K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Evaluation of permutation algorithms

M. K. Roy *

Regional Computer Centre, Calcutta, Jadavpur University Campus, Calcutta, India

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.

Received October 1976.

* Author's Present address, Regional Computer Centre, Calcutta, Jadavapur University Campus, Calcutta, 700 032, India.

§ Computer Centre, Jadavpur University, Calcutta 700032, India


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.