Diegu123

.gitignore

@@ -80,4 +80,11 @@ College/*
 *.swp
 *.lock
 Status API Training Shop Blog About Pricing
-© 2015 GitHub, Inc. Terms Privacy Security Contact Help
+© 2015 GitHub, Inc. Terms Privacy Security Contact Help
+/bin/
+
+# JDT-specific (Eclipse Java Development Tools)
+.classpath
+
+# Eclipse Core
+.project

.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>Programacion2_2_5_2016</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+	</natures>
+</projectDescription>

src/recursion/Recursiones.java

@@ -100,4 +100,16 @@ private boolean primo(int n, int d) {
         }
         return true;
     }
+
+    public int fibonacciUP(int x){
+    	if(x == 0 || x == 1)
+    		return x;
+    	return fibonacciUP(x-1) + fibonacciUP(x-2);
+    }
+
+    public int fibonacciDOWN(int  x, int cont, int f1, int f2){
+    	if(cont <= x)
+    		return fibonacciDOWN(x, cont + 1, f1 + f2, f1);
+    	return f2;
+    }
 }

src/recursion/TestRecursion.java

@@ -33,5 +33,8 @@ public static void main(String[] args) {
         //primo
         System.out.println("Primo 7?: "+recur.primo(7));
         System.out.println("Primo 21?: "+recur.primo(21));
+
+        System.out.println("Fib0 UP (8): " + recur.fibonacciUP(8));
+        System.out.println("Fib0 DOWN (8): " + recur.fibonacciDOWN(8, 1, 1, 0));
     }
 }