/*https://jaeonysos.tistory.comCompare RecursiveP with DynamicPWriter : Mun Jae InDate : 2017.12.16*/#include #include long long Fibonacci_dynamic(int n);long long Fibonacci_recur(int n); long long m[40]={0}; int main(int argc, char * argv[]){clock_t t1,t2;int n;m[1] = 1;m[2] = 2;for(n=20 ; n
