Example : A function to compute factorials : int factorial( int N ) { if ( N == 1 ) return 1 ; else return N * factorial ( N - 1 ) ; } Another example to compute fibonacci values recursively : int fibonacci(int N) { if ( N == 0 or 1 ) return 1 ; else return fibonacci(N-1) + fibonacci(N-2); } Demonstrating a very simple case of recursion to compute factorials : |
Computer Science >