/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

4 votes195 views2 answers
Binary search java
Java
1 vote199 views1 answer
Border bottom android xml
Java
1 vote184 views2 answers
Operador ternario java
Java
-2 votes193 views1 answer
What does ? means in java
Java
0 vote221 views1 answer
Android studio change menu title
Java
0 vote222 views1 answer
How to divide a double in java
Java
0 vote226 views1 answer
Osmdroid get current zoom level
Java
4 votes246 views2 answers
Java how to find the largest number in an arraylist
Java
0 vote218 views1 answer
Share location in android programmatically
Java
0 vote331 views1 answer
Get node inside node in of xml using java
Java