//Iterative Fibonacci series program in Java

​

class Fibonacci{  

public static void main(String args[])  

{   

//Considering the first two numbers as 0 and 1 

 int num1=0,num2=1,num3,i,count=10;  

//Count=10 means that only the first 10 fibonacci numbers will be displayed  

 System.out.print(num1+" "+num2);

//printing 0 and 1    

 for(i=2;i<count;++i)  

//looping is initiated from 2 as 0 and 1 are already printed  

 {    

  num3=num1+num2;    

  System.out.print(" "+num3);    

  num1=num2;    

  num2=num3;    

 }    

}}  

// Java program for the above approach

  // divyaraj

class GFG {

    // Function to print N Fibonacci Number

    static void Fibonacci(int N)

    {

        int num1 = 0, num2 = 1;

        int counter = 0;

        // Iterate till counter is N

        while (counter < N) {

            // Print the number

            System.out.print(num1 + " ");

            // Swap

            int num3 = num2 + num1;

            num1 = num2;

            num2 = num3;

            counter = counter + 1;

        }

    }

    // Driver Code

    public static void main(String args[])

    {

        // Given Number N

        int N = 10;

        // Function Call

        Fibonacci(N);

    }

}

//Fibonacci Series using Recursion

class fibonacci

{

    static int fib(int n)

    {

    if (n <= 1)

       return n;

    return fib(n-1) + fib(n-2);

    }

    public static void main (String args[])

    {

    int n = 9;

    System.out.println(fib(n));

    }

}

​

import java.util.Scanner;

​

public class FibonacciSeries {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

​

        System.out.print("Enter the number of terms: ");

        int n = scanner.nextInt();

​

        System.out.println("Fibonacci Series:");

        int first = 0, second = 1;

​

        for (int i = 1; i <= n; i++) {

            System.out.print(first + " ");

​

            int next = first + second;

            first = second;

            second = next;

        }

​

        scanner.close();

    }

}  

// Java program for the above approach

  // divyaraj

class GFG {

    // Function to print N Fibonacci Number

    static void Fibonacci(int N)

    {

        int num1 = 0, num2 = 1;

        int counter = 0;

        // Iterate till counter is N

        while (counter < N) {

            // Print the number

            System.out.print(num1 + " ");

            // Swap

            int num3 = num2 + num1;

            num1 = num2;

            num2 = num3;

            counter = counter + 1;

        }

    }

    // Driver Code

    public static void main(String args[])

    {

        // Given Number N

        int N = 10;

        // Function Call

        Fibonacci(N);

    }

}