package dk.itu.oop.lecture5;

class FibonacciTests {
	public static int fibA(int N){
		if (N==0) return 0;
		int n1 = 0;
		int n = 1;
		int i = 1;
		while (i<N){
			int tmp = n;
			n = n+ n1;
			n1 = tmp;
			i ++;
		}
		return n;
	}

	public static int fibB(int N){
		if (N==0) return 0;
		int[] f={0,1};
		int i = 1;
		while (i<N){
			i ++;
			f[i%2] = f[0]+f[1];

		}
		return f[i%2];
	}

	public static void main(String[] args){
		for (int i=0;i<15;i++)
			System.out.print("  " + fibA(i) );
		System.out.println();
		for (int i=0;i<15;i++)
			System.out.print("  " + fibB(i) );
		System.out.println();
	}
}