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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2023 18th Conference on Computer Science and Intelligence Systems (FedCSIS) Jg. 35; S. 979 - 982
Hauptverfasser: Gburzynski, Pawel, Zalewski, Janusz
Format: Tagungsbericht Journal Article
Sprache:Englisch
Veröffentlicht: Polish Information Processing Society 2023
Schlagworte:
algorithm analysis
algorithms
permutations
recursion
ISSN:2300-5963
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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