/Java/Fibonacci numbers using Recursion in Java

Fibonacci numbers using Recursion in Java

import java.util.*;
public class fibonacci{
    public static void main(String args[]){
        int n;
        Scanner sc= new Scanner(System.in);
        n=sc.nextInt();
        sc.close();
        System.out.println(fibo(n));
    }
    public static int fibo(int n){
        if(n==1)return 0;
        else if(n==2)return 1;
        else{
            return fibo(n-1)+fibo(n-2);
        }
    }
}

Source: scaler.com

Similar codes

68 votes402 views6 answers
Remove duplicates from list
Java
2 votes324 views1 answer
Java cmd install raspbian
Java
4 votes363 views1 answer
Shift elements in array java
Java
1 vote351 views1 answer
Javafx filechooser specific file
Java
0 vote311 views1 answer
Array de meses java
Java
0 vote353 views1 answer
Treeset java descending order using comparator
Java
0 vote326 views1 answer
Int p=10, q; switch(p) { case1: q=p*2; break; case2: q=p+2; break; case3: q=p-2; break; }
Java
0 vote318 views1 answer
Getarguments().getstring updates android
Java
0 vote378 views1 answer
Java constructor genertic
Java
0 vote354 views1 answer
No Java files found that extend CordovaActivity.
Java