--Originally published at angelmendozas
I saw this on: http://kenscourses.com/tc101winter2015/2015/use-of-recursion-for-repetitive-algorithms-6/
Basically, recursion in computer science is a method where the solution to a problem is based on solving smaller instances of the same problem.
Recursion is multiplying n times n-1’s factorial f.e. if you choose 4 then the answer is 4×3! so its 4x3x2x1
