Master Theorem For Subtract and Conquer Recurrences | Java code for above the approach . ; Driver Code
class clg { static int fib ( int n ) { if ( n <= 1 ) return n ; return fib ( n - 1 ) + fib ( n - 2 ) ; } public static void main ( String [ ] args ) { int n = 9 ; System . out . println ( fib ( n ) ) ; } }