NDLI: A gentle introduction to mutual recursion

Content Provider	ACM Digital Library
Author	Rubio-Sánchez, Manuel Pareja-Flores, Cristóbal Urquiza-Fuentes, Jaime
Abstract	Recursion is an important topic in computer science curricula. It is related to the acquisition of competences regarding problem decomposition, functional abstraction and the concept of induction. In comparison with direct recursion, mutual recursion is considered to be more complex. Consequently, it is generally addressed superficially in CS1/2 programming courses and textbooks. We show that, when a problem is approached appropriately, not only can mutual recursion be a powerful tool, but it can also be easy to understand and fun. This paper provides several intuitive and attractive algorithms that rely on mutual recursion, and which have been designed to help strengthen students' ability to decompose problems and apply induction. Furthermore, we show that a solution based on mutual recursion may be easier to design, prove and comprehend than other solutions based on direct recursion. We have evaluated the use of these algorithms while teaching recursion concepts. Results suggest that mutual recursion, in comparison with other types of recursion, is not as hard as it seems when: (1) determining the result of a (mathematical) function call, and, most importantly, (2) designing algorithms for solving simple problems.
Starting Page	235
Ending Page	239
Page Count	5
File Format	PDF
ISSN	00978418
DOI	10.1145/1597849.1384334
Journal	ACM SIGCSE Bulletin (SGCS)
Volume Number	40
Issue Number	3
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1978-02-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Mutual recursion Combinatorics Fibonacci numbers Counting problems Recursion problems
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A gentle introduction to mutual recursion

Exploring recursion with fibonacci numbers

An introduction to problem equivalence with combinatorics

Exploring recursion with fibonacci numbers

An introduction to problem equivalence with combinatorics

A gentle introduction to algorithm complexity for CS1 with nine variations on a theme by Fibonacci

Fibonacci Numbers, Reduced Decompositions, and 321/3412 Pattern Classes

A new theorem on the prime-counting function

A gentle introduction to OSGi

A gentle introduction to mutual recursion

Similar Documents

A gentle introduction to mutual recursion

Exploring recursion with fibonacci numbers

An introduction to problem equivalence with combinatorics

Exploring recursion with fibonacci numbers

An introduction to problem equivalence with combinatorics

A gentle introduction to algorithm complexity for CS1 with nine variations on a theme by Fibonacci

Fibonacci Numbers, Reduced Decompositions, and 321/3412 Pattern Classes

A new theorem on the prime-counting function

A gentle introduction to OSGi

A gentle introduction to mutual recursion