--Divide and Conquer
if(termination condition) { solve the problem }
else { break the problem into smaller parts and solve }
'''EX''' -- fibonacci
int fib(int n) { if( n == 0 | | n == 1) return 1;
return fib( n - 1 ) + ( n - 2 ); }
--Divide and Conquer
if(termination condition) { solve the problem }
else { break the problem into smaller parts and solve }
'''EX''' -- fibonacci
int fib(int n) { if( n == 0 | | n == 1) return 1;
return fib( n - 1 ) + ( n - 2 ); }
