Solving Fibonacci sequence problems using recursion and recursion ~ ~ ~

/**
* Use recursion to process Fibonacci sequences
* @param sum
* @param i
* @return
*/
public static int findvalue (int n) {
if (n==1)
{
return 1;
}
if (n==2)
{
return 2;
}
int sum=1;
int pre=1;
for (int i=3;i<=n;i++)
{
int temp=sum;
Sum+=pre;
Pre=temp;
}
return sum;
}

/**
* The Fibonacci sequence is handled in a recursive manner
* @param i
* @return
*/
public static int findValue2 (int i) {
int sum=0;
int pre=1;
if (i==1)
{
return sum;
}
else{
Pre=findvalue (i--);
Sum+=pre;
}
return sum;
}

public static void Main (string[] args) {
int Value=findvalue (30);
int value2=findvalue2 (30);
System.out.println (value);
System.out.println (value2);
}

Solving Fibonacci sequence problems using recursion and recursion ~ ~ ~