/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

0 vote137 views2 answers
How to select multiple non-consecutive words on mac
Java
14 votes179 views2 answers
Java string next line
Java
0 vote132 views1 answer
How to extend a class in java
Java
0 vote166 views1 answer
Check if item lore is something bukkit
Java
1 vote154 views1 answer
How to add elements to an array in java dynamically
Java
0 vote154 views1 answer
Unmarshalling in java
Java
1 vote190 views1 answer
Do while jaca
Java
0 vote142 views1 answer
How to remove duplicate elements from char array in java
Java
0 vote174 views1 answer
How to connect from Android emulator to application on localhost?
Java
0 vote155 views1 answer
How to draw
Java