Java recursive Fibonacci

From , 5 Years ago, written in Java, viewed 210 times.

package algorithm.recursion;
public class RecursionDemo{    
    /**
     * 递归求Fibonacci级数的第n个元素，n基于1的自然数。
     */
    public static int fibonacc(int n){
        if(n<=1) return n;
        else return fibonacc(n-1)+fibonacc(n-2);
    }
    
    /**
     * 迭代求Fibonacci级数的第n个元素，n基于1的自然数。
     */
    public static int fibonacc1(int n){
        int first , second ,result ;
        first =second=result= 1;
        for(int i=3;i<=n ;i++){
            result = first + second;
            first = second;
            second =result;
        }
        return result;
    }    
}
 

Reply to "Java recursive Fibonacci"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters

https://burned.cc - Burn After Reading Website

Pastebin.vip

Java recursive Fibonacci

Reply to "Java recursive Fibonacci"