A Short Note on Computing Permutations

We discuss an algorithm for generating all permutations of numbers between 1 and N. The algorithm is short and efficient, yet its behavior is not obvious from the code, mostly owing to the recursion. The discussion touches upon a few interesting methodological issues and brings in an educational cas...

Full description

Saved in:
Bibliographic Details
Published in:2023 18th Conference on Computer Science and Intelligence Systems (FedCSIS) Vol. 35; pp. 979 - 982
Main Authors: Gburzynski, Pawel, Zalewski, Janusz
Format: Conference Proceeding Journal Article
Language:English
Published: Polish Information Processing Society 2023
Subjects:
algorithm analysis
algorithms
permutations
recursion
ISSN:2300-5963
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We discuss an algorithm for generating all permutations of numbers between 1 and N. The algorithm is short and efficient, yet its behavior is not obvious from the code, mostly owing to the recursion. The discussion touches upon a few interesting methodological issues and brings in an educational case study in recursion.
ISSN:2300-5963
DOI:10.15439/2023F5568