FilesExpand file tree

 master

/

Fibonacci.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

65 lines (50 loc) · 1.41 KB

 master

/

Fibonacci.java

Copy path

Top

File metadata and controls

• Code
• Blame

65 lines (50 loc) · 1.41 KB

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

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

import java.math.BigInteger;

import java.util.HashMap;

public class Fibonacci {

private static HashMap hm = new HashMap();

/**

* @param args

*/

public static void main(String[] args) {

Thread thread1 = new Thread(){

public void run() {

System.out.println("iter" + fibo(50000));

}

};

Thread thread2 = new Thread(){

public void run() {

System.out.println("recur" + fibo(50000));

}

};

thread1.start();

thread2.start();

}

public static int fib(int n){

if (hm.containsKey(n)){

return (int) hm.get(n);

} else {

if (n == 1) {

hm.put(1, 1);

return 1;

} else if (n == 0){

hm.put(0, 0);

return 0;

} else {

int result = fib(n-2) + fib(n-1);

hm.put(n, result);

return result;

}

}

}

public static BigInteger fibo(int n){

BigInteger prev = new BigInteger("0");

BigInteger cur = new BigInteger("1");

BigInteger temp = new BigInteger("0");

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

temp = cur;

cur = cur.add(prev);

prev = temp;

}

return cur;

}

}