Fibonacci naive recursive and 1st optimization done!

It was kinda tricky to get it right, with array indexing and how many I
needed to calculate. Good thing I was using TDD, which helped quite a
bit in getting it done!

1 files changed, 29 insertions, 0 deletions

diff --git a/AlgoDesignAndTechniqueEdxJava/tests/FibonacciTest.java b/AlgoDesignAndTechniqueEdxJava/tests/FibonacciTest.java
new file mode 100644
index 0000000..52df692
--- /dev/null
+++ b/AlgoDesignAndTechniqueEdxJava/tests/FibonacciTest.java
@@ -0,0 +1,29 @@
+
+import static org.junit.jupiter.api.Assertions.*;
+
+import org.junit.jupiter.api.Test;
+
+public class FibonacciTest {
+
+	@Test
+	void testFibonacci0() {
+		assertEquals(0, Fibonacci.fib_naive(0));
+		assertEquals(0, Fibonacci.fib_optimized1(0));
+	}
+
+	@Test
+	void testFibonacci1() {
+		assertEquals(1, Fibonacci.fib_naive(1));
+		assertEquals(1, Fibonacci.fib_optimized1(1));
+	}
+
+	@Test
+	void testFibonacci40() {
+		assertEquals(102334155, Fibonacci.fib_naive(40));
+		assertEquals(1, Fibonacci.fib_optimized1(2));
+		assertEquals(2, Fibonacci.fib_optimized1(3));
+		assertEquals(3, Fibonacci.fib_optimized1(4));
+		assertEquals(102334155, Fibonacci.fib_optimized1(40));
+	}
+
+}