Prepare for your exams
Get points
Guidelines and tips

Prepare for your exams

Study with the several resources on Docsity

Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips

Sell on Docsity

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search Store documents

The best documents sold by students who completed their studies

Search through all study resources

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents

20 Points

For each uploaded document

Answer questions

5 Points

For each given answer (max 1 per day)

All the ways to get free points

Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

University Rankings

Discover the best universities in your country according to Docsity users

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

From our blog

Exams and Study

Go to the blog

Recursion: Understanding Functions that Call Themselves, Slides of Computer Fundamentals

Jaipur National University Computer Fundamentals

An introduction to recursion, a programming concept where functions call themselves to solve complex problems. It covers the basics of recursive functions, their limitations, and how they can be used to compute factorials and the fibonacci series. The document also discusses recursion vs. Iteration.

Typology: Slides

2011/2012

Uploaded on 07/31/2012

karthik 🇮🇳

4.6

(16)

95 documents

1 / 13

This page cannot be seen from the preview

Don't miss anything!

5.13 Recursion

• Recursive functions

– Functions that call themselves

– Can only solve a base case

– Divide a problem up into

• What it can do

• What it cannot do

– What it cannot do resembles original problem

– The function launches a new copy of itself (recursion step)

to solve what it cannot do

– Eventually base case gets solved

• Gets plugged in, works its way up and solves whole problem

docsity.com

Partial preview of the text

Download Recursion: Understanding Functions that Call Themselves and more Slides Computer Fundamentals in PDF only on Docsity!

5.13 Recursion

• Recursive functions

– Functions that call themselves

– Can only solve a base case

– Divide a problem up into

• What it can do

• What it cannot do

– What it cannot do resembles original problem

– The function launches a new copy of itself (recursion step)

to solve what it cannot do

– Eventually base case gets solved

• Gets plugged in, works its way up and solves whole problem

5.13 Recursion

• Example: factorials

– Notice that

– Can compute factorials recursively

– Solve base case (1! = 0! = 1 ) then plug in

Outline

fig05_14.c (Part 1

of 2)

Outline

 - fig05_14.c (Part

1! = of 2)
2! =
3! =
4! =
5! =
6! =
7! =
8! =
9! =
10! =

Recursion: Understanding Functions that Call Themselves, Slides of Computer Fundamentals

Related documents

Partial preview of the text

Download Recursion: Understanding Functions that Call Themselves and more Slides Computer Fundamentals in PDF only on Docsity!

5.13 Recursion

• Recursive functions

– Functions that call themselves

– Can only solve a base case

– Divide a problem up into

• What it can do

• What it cannot do

– What it cannot do resembles original problem

– The function launches a new copy of itself (recursion step)

to solve what it cannot do

– Eventually base case gets solved

• Gets plugged in, works its way up and solves whole problem

5.13 Recursion

• Example: factorials

– Notice that

– Can compute factorials recursively

– Solve base case (1! = 0! = 1 ) then plug in

Outline

fig05_14.c (Part 1

of 2)

Outline

5.14 Example Using Recursion: The

Fibonacci Series

• Set of recursive calls to function fibonacci

f( 3 )

f( 2 ) f( 1 )

f( 1 ) f( 0 ) return 1

return 1 return 0

return +

return +

Outline

fig05_15.c (Part 1

of 2)

Outline

Program Output

(continued)

5.14 Example Using Recursion: The

Fibonacci Series

5.15 Recursion vs. Iteration