Skip to main content
Journal ArticleOPEN ACCESS

Permutations by Interchanges

  • Heap B
The Computer Journal (1963) 6(3) 293-298
DOI: 10.1093/comjnl/6.3.293
N/ACitations
Citations of this article
26Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Methods for obtaining all possible permutations of a number of objects, in which each permutation differs from its predecessor only by the interchange of two of the objects, are discussed. Details of two programs which produce these permutations are given, one allowing a specified position to be filled by each of the objects in a predetermined order, the other needing the minimum of storage space in a computer.

Cite

CITATION STYLE

APA

Heap, B. R. (1963). Permutations by Interchanges. The Computer Journal, 6(3), 293–298. https://doi.org/10.1093/comjnl/6.3.293

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free