Year: 2023
Type: conference-paper
Abstract: 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.
DOI: 10.15439/2023f5568
Authors: Paweł Gburzyński, Janusz Zalewski
Language: English
Subfield: Computer Science Applications
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4387608617
