/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 vote354 views1 answer
Do not treat position as fixed; only use immediately and call `holder.getAdapterPosition()` to look it up later
Java
0 vote345 views1 answer
List into string java
Java
0 vote327 views1 answer
Java unused import statement
Java
0 vote356 views5 answers
Java arraylist
Java
2 votes389 views2 answers
Java double to float
Java
2 votes316 views1 answer
String to double java exception
Java
1 vote278 views3 answers
Passing arrays to methods in java
Java
6 votes358 views3 answers
How to install java 11 jdk on ubuntu 20.04
Java
0 vote313 views1 answer
Why the fuck java suck
Java
0 vote333 views3 answers
Float
Java