/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 vote292 views1 answer
How to skip a line with a filewriter java
Java
1 vote307 views2 answers
Use custom font java
Java
0 vote298 views1 answer
Java.lang.long cannot be cast to java.lang.integer
Java
0 vote294 views1 answer
Odd or even program in java using a mod operator
Java
0 vote307 views1 answer
Quick sort in java progrmmieren
Java
0 vote305 views1 answer
Intent code to open image only in gallery
Java
1 vote344 views1 answer
Renardfute
Java
0 vote296 views2 answers
How to iterate list in java selenium
Java
4 votes322 views2 answers
The type javax.servlet.ServletException cannot be resolved. It is indirectly referenced from required .class files
Java
1 vote303 views1 answer
How to have multiple extensions in one filter java
Java