Move Fibonacci to run-test.
Change-Id: I52bc4e68f59da9d327d373a7cb81f5b960f5416e
diff --git a/test/101-fibonacci/src/Main.java b/test/101-fibonacci/src/Main.java
new file mode 100644
index 0000000..3773e1b
--- /dev/null
+++ b/test/101-fibonacci/src/Main.java
@@ -0,0 +1,58 @@
+/*
+ * Copyright (C) 2011 The Android Open Source Project
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+class Main {
+
+/*
+ // Iterative version
+ static int fibonacci(int n) {
+ if (n == 0) {
+ return 0;
+ }
+ int x = 1;
+ int y = 1;
+ for (int i = 3; i <= n; i++) {
+ int z = x + y;
+ x = y;
+ y = z;
+ }
+ return y;
+ }
+*/
+
+ // Recursive version
+ static int fibonacci(int n) {
+ if ((n == 0) || (n == 1)) {
+ return n;
+ } else {
+ return fibonacci(n - 1) + (fibonacci(n - 2));
+ }
+ }
+
+ public static void main(String[] args) {
+ String arg = (args.length > 0) ? args[0] : "10";
+ try {
+ int x = Integer.parseInt(arg);
+ int y = fibonacci(x);
+ System.out.printf("fibonacci(%d)=%d\n", x, y);
+ y = fibonacci(x + 1);
+ System.out.printf("fibonacci(%d)=%d\n", x + 1, y);
+ } catch (NumberFormatException ex) {
+ System.err.println(ex);
+ System.exit(1);
+ }
+ }
+}