From fbb7a456c31735a1ddcef76377b04fbd5936a679 Mon Sep 17 00:00:00 2001
From: ameya <ameyashahu@gmail.com>
Date: Mon, 21 Oct 2019 16:42:41 +0530
Subject: [PATCH 1/2] fibonnaci using dynamic programming

---
 .../{ => backtracking}/nqueen.c               |  0
 .../dynamic programming/fibbonacci.c          | 29 +++++++++++++++++++
 2 files changed, 29 insertions(+)
 rename Data Structure & Algorithm/{ => backtracking}/nqueen.c (100%)
 create mode 100644 Data Structure & Algorithm/dynamic programming/fibbonacci.c

diff --git a/Data Structure & Algorithm/nqueen.c b/Data Structure & Algorithm/backtracking/nqueen.c
similarity index 100%
rename from Data Structure & Algorithm/nqueen.c
rename to Data Structure & Algorithm/backtracking/nqueen.c
diff --git a/Data Structure & Algorithm/dynamic programming/fibbonacci.c b/Data Structure & Algorithm/dynamic programming/fibbonacci.c
new file mode 100644
index 0000000..b8dbeb2
--- /dev/null
+++ b/Data Structure & Algorithm/dynamic programming/fibbonacci.c	
@@ -0,0 +1,29 @@
+//Fibonacci Series using Dynamic Programming 
+#include<stdio.h> 
+
+int fib(int n) 
+{ 
+
+int f[n+2]; 
+int i; 
+
+
+f[0] = 0; 
+f[1] = 1; 
+
+for (i = 2; i <= n; i++) 
+{ 
+	
+	f[i] = f[i-1] + f[i-2]; 
+} 
+
+return f[n]; 
+} 
+
+int main () 
+{ 
+int n = 9; 
+printf("%d", fib(n)); 
+getchar(); 
+return 0; 
+} 

From cdce87884a081b3e384060f590d445070b9e4ed5 Mon Sep 17 00:00:00 2001
From: ameya <ameyashahu@gmail.com>
Date: Mon, 21 Oct 2019 21:51:15 +0530
Subject: [PATCH 2/2] discription added to fibbonacci.c

---
 .../dynamic programming/fibbonacci.c                  | 11 +++++++++--
 1 file changed, 9 insertions(+), 2 deletions(-)

diff --git a/Data Structure & Algorithm/dynamic programming/fibbonacci.c b/Data Structure & Algorithm/dynamic programming/fibbonacci.c
index b8dbeb2..1d6c172 100644
--- a/Data Structure & Algorithm/dynamic programming/fibbonacci.c	
+++ b/Data Structure & Algorithm/dynamic programming/fibbonacci.c	
@@ -1,4 +1,9 @@
-//Fibonacci Series using Dynamic Programming 
+
+/*
+Description :- This program will print 'n'th term of fibbonacci series using dynamic programming
+Input Format: Enter an intger :- 10
+Output Format: 55
+*/
 #include<stdio.h> 
 
 int fib(int n) 
@@ -22,7 +27,9 @@ return f[n];
 
 int main () 
 { 
-int n = 9; 
+int n;
+printf("Enter an intger :-\n");
+scanf("%d",&n);
 printf("%d", fib(n)); 
 getchar(); 
 return 0;