Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Using Memoization for Fibonacci sequence #1

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 27 additions & 0 deletions memoization.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
#include<bits/stdc++.h>
#include<iostream>
#define mod 1000000007
typedef long long int lli;
lli fib(lli n,lli memo[])
{
lli res;
if(memo[n]!=0)
return memo[n];
if(n==1 || n==2)
res = 1;
else
res = fib(n-1,memo) + fib(n-2,memo);
memo[n]=res;
return res;
}
using namespace std;
int main()
{
lli memo[100000]={0},n,p;
cout<<"Enter the value of n :\n";
cin>>n;
p = fib(n,memo);
cout<<p<<endl;
return 0;
}