CSCE 314 Programming Languages - TAMU Computer Science ...

Recursive FunctionsFunctions can also be defined in terms ofthemselves. Such functions are called recursive.factorial 0 = 1factorial n = n * factorial (n-1)factorial 3 = 3 * factorial 2= 3 * (2 * factorial 1)====3 * (2 * (1 * factorial 0))3 * (2 * (1 * 1))3 * (2 * 1)3 * 2factorial maps 0 to 1,and any otherpositive integer tothe product of itselfand the factorial ofits predecessor.= 636