Skip to main content
ICT
Lesson AB24 - Recursive Array Programming
 
Main   Previous Next
 

Summary/Review page 6 of 7

Some of the earlier examples of recursion were applied to linear problems. The factorial or Fibonacci problems were one dimensional, which required only one recursive call within the algorithm. The maze problem is best-solved recursively because of the different directions that the problem solving takes. Loosely stated, any problem that involves multiple directions and returning to a branch point is a likely candidate for recursion.

Main   Previous Next
Contact
 © ICT 2006, All Rights Reserved.