Master Theorem For Subtract and Conquer Recurrences | C # code for above the approach . ; Driver Code
using System ; class GFG { 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 ; Console . WriteLine ( fib ( n ) ) ; } }