Recursion is a technique in which a function calls itself, for example in this code factorial function is calling itself. To solve a problem using recursion you must first express its solution in recursive form.
Factorial is represented using '!', so five factorial will be written as (5!), n factorial as (n!). Also
n! = n*(n-1)*(n-2)*(n-3)...3.2.1 and zero factorial is defined as one i.e. 0! = 1.
On this page of the site you can watch the video online C programming tutorial to find factorial using recursive function with a duration of hours minute second in good quality, which was uploaded by the user Reyad Hossain 30 January 2016, share the link with friends and acquaintances, this video has already been watched 516 times on youtube and it was liked by 7 viewers. Enjoy your viewing!