Introducing recursion by parking cars
Michael A. Wirth
Abstract
Michael A. Wirth
Abstract
Many approaches to teaching recursion in textbooks focus on classical examples such as Fibonacci, factorial, or the Towers of Hanoi. As established as these algorithms are, they don't really illustrate the potential of recursion. This paper explores the use of a novel recursive algorithm which requires innovative thinking, and the use of random numbers. The algorithm looks at the use of recursion to randomly park cars on a street.
OpenAlex reports 17 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Many approaches to teaching recursion in textbooks focus on classical examples such as Fibonacci, factorial, or the Towers of Hanoi. As established as these algorithms are, they don't really illustrate the potential of recursion. This paper explores the use of a novel recursive algorithm which requires innovative thinking, and the use of random numbers. The algorithm looks at the use of recursion to randomly park cars on a street.
Key concepts: Recursion (computer science), Mutual recursion, Fibonacci number, Focus (optics), Computer science, Theoretical computer science, Algorithm, Mathematics