/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 vote108 views1 answer
Returning an Array from a Method
Java
0 vote143 views1 answer
How to open a desktop application using java
Java
4 votes95 views5 answers
Java while
Java
8 votes93 views4 answers
What is method in java
Java
7 votes108 views3 answers
Loop through java object
Java
2 votes97 views1 answer
Java split for multiple characters
Java
0 vote122 views1 answer
Generate an array with random numbers in a range java
Java
-1 vote106 views1 answer
MapToString in java
Java
0 vote108 views1 answer
Java dateigröße abfragen
Java
3 votes108 views1 answer
How to converet negative byte value to postive int value in java
Java