An introduction to problem equivalence with combinatorics
Proceedings of the 7th annual conference on Innovation and technology in computer science education, pp. 313-313, 2008.
recursionfibonacci numberfibonacci numbersnp completenesscounting problemsMore(1+)
This paper proposes the use of several classes of simple combinatorial problems that share the same solution for teaching problem equivalence and recursion. Our focus is on counting problems that involve Fibonacci numbers. While these problems have simple recursive solutions, we propose that - for teaching purposes - they can also be solv...More
Full Text (Upload PDF)
PPT (Upload PPT)