/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 vote149 views1 answer
Ecludis
Java
0 vote116 views1 answer
Java lexographic
Java
1 vote127 views3 answers
Java double to string with comma
Java
2 votes191 views1 answer
How to print in console java
Java
1 vote115 views1 answer
How to set list data to android spinner
Java
0 vote138 views1 answer
How to make character in jframe
Java
0 vote128 views1 answer
How to add chips dynamically android
Java
1 vote120 views1 answer
Android gridlayout equal column width
Java
0 vote129 views1 answer
Java read file from command line argument
Java
10 votes165 views2 answers
How to substring in java
Java