/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

1 vote169 views1 answer
Android java increment hashmap value
Java
0 vote169 views1 answer
Jsp multipart/form-data submition
Java
0 vote159 views1 answer
Convert object address to string in java
Java
5 votes240 views1 answer
Refresh activity android
Java
50 votes164 views4 answers
How to find last element in array java
Java
1 vote173 views1 answer
Java print stacktrace to file
Java
25 votes182 views3 answers
Check last character of a string java
Java
0 vote170 views1 answer
Convert boolean list to primitive java
Java
0 vote191 views1 answer
Bad notification for startForeground: java.lang.RuntimeException: invalid channel for service notification: Notification
Java
0 vote158 views1 answer
Android studio allow http
Java