Advertisement
Guest User

Untitled

a guest
Jun 17th, 2019
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.14 KB | None | 0 0
  1. public class Fibonacci {
  2. private static int[] data;
  3.  
  4. public static void DynamicArray() {
  5. data = new int[1];
  6. }
  7.  
  8. public static int get(int position) {
  9. if (position >= data.length){
  10. return 0;
  11. } else {
  12. return data[position];
  13. }
  14. }
  15.  
  16. public static void put(int position, int value) {
  17. if(position >= data.length) {
  18. int newSize = 2 * position;
  19. int[] newData = new int[newSize];
  20. System.arraycopy(data, 0, newData, 0, data.length);
  21. data = newData;
  22. }
  23. data[position] = value;
  24. }
  25.  
  26. public static void main(String[] args) {
  27. System.out.println("nFibonacci Sequence:n");
  28. System.out.println(data[0]);
  29. for(int i = 2; i< = 20; i++) {
  30. data[i] = data[i-1] + data[i-2];
  31. System.out.println(data[i]);
  32. }
  33. }
  34. }
  35.  
  36. import java.util.Scanner;
  37.  
  38. public class DynamicArray
  39. {
  40. public static void
  41.  
  42. d main (String[] args){
  43. System.out.println("How Long Do You Want To see the Fibonacci Series?");
  44. Scanner scan = new Scanner (System.in);
  45. int Length = scan.nextInt();
  46.  
  47. int[] Fibonacci = new int[Length];
  48. Fibonacci[0] = 0;
  49. Fibonacci[1] = 1;
  50. System.out.println("Fibonacci Series");
  51.  
  52. System.out.println(Fibonacci[0]);
  53.  
  54. for (int i = 2; i<Length; i++){
  55. Fibonacci[i]=Fibonacci[i-2]+Fibonacci[i-1];
  56.  
  57. System.out.println(Fibonacci[i]);
  58.  
  59. }
  60. }
  61. }
  62.  
  63. while (sequence<4000000)
  64. {
  65. i++;
  66. sequence = fibonacciSequence[0]+fibonacciSequence[1];
  67. System.out.println(sequence);
  68. if (i%2!=0)
  69. {
  70. fibonacciSequence[0]=sequence;
  71. }
  72. else
  73. {
  74. fibonacciSequence[1]=sequence;
  75. }
  76. if (sequence%2==0)
  77. {
  78. sumEvenTerm = sumEvenTerm + sequence;
  79. }
  80. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement