피보나치

src/kr/co/swh/lecture/algorithm/Fibonacci2.java

@@ -19,6 +19,7 @@ public class Fibonacci2 {
 		return recursive(value-2) + recursive(value-1);
 	}
 	public static void main(String[] args) {
-		recursive(7);
+		int s = recursive(7);
+		System.out.printf("7번째 숫자: %d", s);
 	}
 }

src/kr/co/swh/lecture/algorithm/Fibonacci3.java

@@ -29,7 +29,10 @@ public class Fibonacci3 {
 		fibo = new int[value+1];
 		recursive(value);
 		int sum = 0;
-		for(int i: fibo) sum += i;
+		for(int i: fibo) {
+		    System.out.println(i);
+		    sum += i;
+		}
 		System.out.printf("더한 값: %d\n", sum);
 	}
 }

src/kr/co/swh/lecture/algorithm/Fibonacci4.java

@@ -23,7 +23,7 @@ public class Fibonacci4 {
 		return fibo[x];
 	}
 	public static void main(String[] args) {
-		int value = 10;
-		System.out.printf("더한 값: %d\n", recursive(value));
+		int value = 7;
+		System.out.printf("7번째 숫자: %d", recursive(value));
 	}
 }