An amazing exercise in recursion for CS1 and CS2
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Problems in comprehending recursion and suggested solutions
Proceedings of the 6th annual conference on Innovation and technology in computer science education
The case of base cases: why are they so difficult to recognize? student difficulties with recursion
Proceedings of the 7th annual conference on Innovation and technology in computer science education
What do novice programmers know about recursion
CHI '83 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
A framework for teaching recursion
ACM SIGCSE Bulletin
The novice programmer's "device to think with"
Proceedings of the 42nd ACM technical symposium on Computer science education
Using cargo-bot to provide contextualized learning of recursion
Proceedings of the ninth annual international ACM conference on International computing education research
| Hi-index | 0.00 |
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.