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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2023 18th Conference on Computer Science and Intelligence Systems (FedCSIS) Ročník 35; s. 979 - 982
Hlavní autori: Gburzynski, Pawel, Zalewski, Janusz
Médium: Konferenčný príspevok.. Journal Article
Jazyk:English
Vydavateľské údaje: Polish Information Processing Society 2023
Predmet:
algorithm analysis
algorithms
permutations
recursion
ISSN:2300-5963
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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