# What topics to cover in a 15 min presentation on recursion?

• 09-25-2012
manasij7479
What topics to cover in a 15 min presentation on recursion?
So far, I've chalked out the following:
1.Definition (with the factorial or euclid's algorithm example)
2.Self referential structures.
3.Show intuitively that recursion is equivalent to iteration.
4.General approach of Divide and Conquer algorithms.
5.Show how the stack is used in recursion.
6.Performance, tail recursion..etc.

Which among the above do you think should be left out, given the time constrain?
Anything important I missed?
• 09-25-2012
Elkvis
don't forget #7: recursion
• 09-25-2012
whiteflags
I think 1, 3, and 5 are a well rounded presentation; only tack on more points for time. I have never considered self-referential structures to be an example of recursion. Also, ending the presentation threatening to start it again would probably be good humor. :)
• 09-25-2012
phantomotap
Quote:

Self referential structures.
O_o

Recursion is a form of repeating a process; data structures are not processes.

I know what you are getting at of course; I'm just saying that you need to keep focus on the process.

Soma
• 09-26-2012
laserlight
Who will be your audience and what is the purpose of this presentation?
• 09-26-2012
manasij7479
Quote:

Originally Posted by laserlight
Who will be your audience and what is the purpose of this presentation?

Classmates and a few teachers.
It is a compulsory part of the semester exams.
• 09-26-2012
Neo1
You'll have less than 3 minutes for each of those topics, are you sure you can fit all that in such a small time-frame? I'd say you should cut off some of the less important parts, understanding D&Q isn't necessary for understanding recursion, same goes for self-referential structures.

You could mention how to determine the computational cost using recurrence relations, this probably fits under your #6.
• 09-26-2012
manasij7479
Quote:

Originally Posted by Neo1
You'll have less than 3 minutes for each of those topics, are you sure you can fit all that in such a small time-frame? I'd say you should cut off some of the less important parts, understanding D&Q isn't necessary for understanding recursion, same goes for self-referential structures.

Hmm, I'll just leave those points by mentioning a few examples.
Quote:

You could mention how to determine the computational cost using recurrence relations, this probably fits under your #6.
Good idea.
Though I have to make it quick and simplified enough for non-mathematically-oriented people to grasp.
(I read the chapter on Master theorem in the Cormen book a few days ago, and it sure is a bit whacky)