Master Theorem For Subtract and Conquer Recurrences |  ; Driver Code
#include <stdio.h> NEW_LINE int fib ( int n ) { if ( n <= 1 ) return n ; return fib ( n - 1 ) + fib ( n - 2 ) ; } int main ( ) { int n = 9 ; printf ( " % d " , fib ( n ) ) ; getchar ( ) ; return 0 ; }