By arunraj
//recursion
public static int fib(int a)
{
if(a==0)return 0;
if(a==1)return 1;
return fib(a-1)+fib(a-2);
}
//dynamic programming
public static void fib1(int n)
{
int[] fib = new int[n];
if(n==0){System.out.println(0);return;}// 0;
if(n==1){System.out.println(1);return;}
fib[0]=0;
fib[1]=1;
for(int i=2;i<n;i++)
{
fib[i]=fib[i-1]+fib[i-2];
}
System.out.println(Arrays.toString(fib));
}
public static int fib(int a)
{
if(a==0)return 0;
if(a==1)return 1;
return fib(a-1)+fib(a-2);
}
//dynamic programming
public static void fib1(int n)
{
int[] fib = new int[n];
if(n==0){System.out.println(0);return;}// 0;
if(n==1){System.out.println(1);return;}
fib[0]=0;
fib[1]=1;
for(int i=2;i<n;i++)
{
fib[i]=fib[i-1]+fib[i-2];
}
System.out.println(Arrays.toString(fib));
}
Interview Questions: