A recursive function is one that calls itself with a smaller version of the problem until it reaches a known answer (the base case). Recursion shines when a problem's structure mirrors itself — like a ...

all integers smaller than or equal to n. For example factorial of 6 is 6*5*4*3*2*1 which is 720.