CIS 2500 Lecture Notes - Lecture 13: Grater, Tower Of Hanoi, Quicksort

• School: University of Guelph
• Department: Computing and Information Science
• Course: CIS 2500
• Professor: Deborah Stacey

Document Summary

Or when a series of subroutines eventually invoke the first subroutine again the intent is to break a large problem into smaller and simpler problems these smaller solutions are then sombined to solve the larger problem. Factorial example factorials can be calculated recursievly n! = n x (n -1) x (n - 2) x 1 n! = nx(n-1)! if n>0 this second condition suggests recursion the calculation is done with reference to itself. A base case that is processed without recursion. this requires an ending ocndition that knows when to apply the base case. A method that reduces a particular case to one or more smaller cases. this requires a recursive call in the factorial example the base case is n! = 1 if n = 0 (no further recursion needed) And the method to reduce a case to a smaller one is n!