Exploring recursion with fibonacci numbers

This paper addresses the relationship between recursion and combinatorial problems, which may benefit teaching recursion in CS1/2 courses. Problems whose solutions are related to Fibonacci numbers are particularly interesting, since some can be decomposed by using different strategies, which may be...

Full description

Saved in:
Bibliographic Details
Published in:SIGCSE bulletin 2007-06, Vol.39 (3), p.359-359
Main Authors: Rubio-Sánchez, Manuel, Hernán-Losada, Isidoro
Format: Article
Language:English
Subjects:
Combinatorics
Computer science education
Computing education
Computing education programs
Discrete mathematics
Enumeration
Functional languages
General programming languages
Information science education
Language types
Mathematics of computing
Professional topics
Social and professional topics
Software and its engineering
Software notations and tools
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses the relationship between recursion and combinatorial problems, which may benefit teaching recursion in CS1/2 courses. Problems whose solutions are related to Fibonacci numbers are particularly interesting, since some can be decomposed by using different strategies, which may be based on the numerous Fibonacci identities or even on the concept of mutual recursion.
ISSN:0097-8418
2331-3927
DOI:10.1145/1269900.1268931