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ženo v:
Podrobná bibliografie
Vydáno v:2023 18th Conference on Computer Science and Intelligence Systems (FedCSIS) Ročník 35; s. 979 - 982
Hlavní autoři: Gburzynski, Pawel, Zalewski, Janusz
Médium: Konferenční příspěvek Journal Article
Jazyk:angličtina
Vydáno: Polish Information Processing Society 2023
Témata:
algorithm analysis
algorithms
permutations
recursion
ISSN:2300-5963
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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