/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 vote285 views1 answer
Richest Customer Wealth
Java
1 vote309 views2 answers
Handler delay android
Java
4 votes282 views2 answers
Java round to nearest 5
Java
-1 vote322 views2 answers
Call activity method from adapter
Java
1 vote287 views1 answer
How to chage font progrmatically
Java
1 vote290 views1 answer
An enclosing instance that contains Outer.Inner is required
Java
0 vote279 views1 answer
Wsl-allow-port
Java
0 vote306 views1 answer
How to load template file from resource folder in spring boot project
Java
1 vote296 views1 answer
String vs stringbuilder
Java
0 vote331 views1 answer
Java compile
Java