Introduction to Recursion
摘要
An algorithm is said to be recursiveRecursivity if it makes a call to itself. In other terms, the procedure to solve the problem for a given instance I includes the resolution of the same problem for another instance \(I'\) (generally having smaller size than I).