CSC 2200 Lecture Notes - Lecture 4: Dspace, Mathematical Puzzle, Time Complexity
10 views4 pages
19 Jul 2018
School
Department
Course
Professor
CSC 2200 lecture 4
• Recursion
o Some computer programming languages allow a module or function to call itself.
This technique is known as recursion
o In recursion, a function α either calls itself directly or calls a function β that in
turn calls the original function α. The function α is called recursive function.
o Example
▪
▪
• Properties of recursion
o A recursive function can go infinite like a loop. To avoid infinite running of
recursive function, there are two properties that a recursive function must have
–