Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Fibonacci {
- private static int[] data;
- public static void DynamicArray() {
- data = new int[1];
- }
- public static int get(int position) {
- if (position >= data.length){
- return 0;
- } else {
- return data[position];
- }
- }
- public static void put(int position, int value) {
- if(position >= data.length) {
- int newSize = 2 * position;
- int[] newData = new int[newSize];
- System.arraycopy(data, 0, newData, 0, data.length);
- data = newData;
- }
- data[position] = value;
- }
- public static void main(String[] args) {
- System.out.println("nFibonacci Sequence:n");
- System.out.println(data[0]);
- for(int i = 2; i< = 20; i++) {
- data[i] = data[i-1] + data[i-2];
- System.out.println(data[i]);
- }
- }
- }
- import java.util.Scanner;
- public class DynamicArray
- {
- public static void
- d main (String[] args){
- System.out.println("How Long Do You Want To see the Fibonacci Series?");
- Scanner scan = new Scanner (System.in);
- int Length = scan.nextInt();
- int[] Fibonacci = new int[Length];
- Fibonacci[0] = 0;
- Fibonacci[1] = 1;
- System.out.println("Fibonacci Series");
- System.out.println(Fibonacci[0]);
- for (int i = 2; i<Length; i++){
- Fibonacci[i]=Fibonacci[i-2]+Fibonacci[i-1];
- System.out.println(Fibonacci[i]);
- }
- }
- }
- while (sequence<4000000)
- {
- i++;
- sequence = fibonacciSequence[0]+fibonacciSequence[1];
- System.out.println(sequence);
- if (i%2!=0)
- {
- fibonacciSequence[0]=sequence;
- }
- else
- {
- fibonacciSequence[1]=sequence;
- }
- if (sequence%2==0)
- {
- sumEvenTerm = sumEvenTerm + sequence;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement