/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

1 vote271 views1 answer
Jda embed message
Java
0 vote235 views1 answer
Open google maps cycling navigation
Java
1 vote265 views1 answer
Java declare multilayred array values
Java
0 vote276 views1 answer
Java bukkit double jump
Java
0 vote235 views1 answer
Does JVM create object of Main class (the class with main())?
Java
1 vote246 views1 answer
How to implement linked list in java without using collection framework
Java
0 vote253 views1 answer
Mock ParameterizedTypeReference
Java
0 vote269 views1 answer
Short array in java
Java
0 vote253 views1 answer
Java copy string
Java
1 vote228 views1 answer
How to set list data to android spinner
Java