FilesExpand file tree

 main

/

FibonacciSeries.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

29 lines (25 loc) · 800 Bytes

 main

/

FibonacciSeries.java

Copy path

Top

File metadata and controls

• Code
• Blame

29 lines (25 loc) · 800 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

//Write a program to print Fibonacci series of n terms where n is

//input by user :0 1 1 2 3 5 8 13 21 .....

//In the Fibonacci series, a number is the sum of the previous 2 numbers

// that came before it.

package Function;

import java.util.*;

public class FibonacciSeries {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

int n = sc.nextInt();

int a = 0, b = 1;

System.out.println(a+ " ");

if(n > 1){

// find nth number

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

System.out.println(b+" ");

// the concept below is called swapping

int temp = b;

b = a+b;

a = temp;

}

System.out.println();

}

}

}