/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

2 votes356 views2 answers
Cls java
Java
3 votes351 views2 answers
How to print something on java
Java
10 votes392 views2 answers
Maven test class
Java
0 vote390 views1 answer
Alphabet n vowelin java
Java
-2 votes340 views1 answer
Void vs return type
Java
4 votes379 views4 answers
Java while loop example
Java
1 vote342 views1 answer
Bungeecord plugin add configs
Java
-1 vote378 views2 answers
Calculating the percentile in java
Java
0 vote372 views1 answer
Handle customized popup in selenium
Java
0 vote358 views1 answer
Rgb code from java color
Java