Commit b56838b

committed

removed errors from fibonacci series using dp

1 parent 222a238 commit b56838bCopy full SHA for b56838b

File tree

-71

lines changed

Dynamic-Programming
- Fibonacci-Series.cpp
- Rod-Cutting
  - README.md
  - rod-cut.cpp
Sphere Online Judge/FCTRL
- README.md
- fctrl.cpp

-71

lines changed

Lines changed: 5 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,21 +1,20 @@`
`1`		`-//This is a C++ Program to print Fibonacci Series upto a given number entered by the user`
`2`		`-//solved using basic Dynamic Programming Technique`
`3`	`1`	`#include<bits/stdc++.h>`
`4`	`2`	`using namespace std;`
	`3`	`+`
`5`	`4`	`int main()`
`6`	`5`	`{`
`7`	`6`	`vector <long int> fib;`
`8`	`7`	`long int n;`
`9`	`8`	`cout<<"Enter the length of fibonacci series to print :";`
`10`	`9`	`cin>>n;`
`11`		`- fib[0]=fib.push_back(0);`
`12`		`- fib[1]=fib.push_back(1);`
	`10`	`+ fib.push_back(0);`
	`11`	`+ fib.push_back(1);`
`13`	`12`	`for(long int i=2;i<=n;i++)`
`14`	`13`	`{`
`15`		`- fib[i]=fib.push_back(fib[i-1]+fib[i-2]); //Here I am using the values stored in the past, reducing the time at cost of more space (Compared to Recursive Solution)`
	`14`	`+ fib.push_back(fib[i-1]+fib[i-2]); //Here I am using the values stored in the past, reducing the time at cost of more space (Compared to top down Recursive Solution)`
`16`	`15`	`}`
`17`	`16`	`//Printing the Series`
`18`		`- for(long int i=0;i<fib.size();fib++)`
	`17`	`+ for(long int i=0;i<fib.size();i++)`
`19`	`18`	`{`
`20`	`19`	`cout<<fib[i]<<", ";`
`21`	`20`	`}`

Lines changed: 0 additions & 11 deletions

This file was deleted.

Lines changed: 0 additions & 33 deletions

This file was deleted.

Lines changed: 0 additions & 3 deletions

This file was deleted.

Lines changed: 0 additions & 18 deletions

This file was deleted.

Comments

(0)