Changeset 397 in Java_Quellcode_SOOP_Vorlesung

Timestamp:

Dec 5, 2017, 9:36:04 AM (7 years ago)

Author:

tr

Message:

Rekursion über Arrays

Location:

rekursion

Files:

• Rekursion.java (modified) (2 diffs)
• RekursionMain.java (deleted)

rekursion/Rekursion.java

@@ -1 +1 @@
 package eu.hsrw.tr.prog.vl.rekursion;
+
+import java.util.Arrays;
 
 /**
@@ -100 +102 @@
         return istPalindrom(s.substring(1, s.length() - 1));
     }
+    
+    public static int minRekursiv(int[] a, int pos) {
+        if (pos == a.length - 1) {
+            return a[pos];
+        }
+        int minRest = minRekursiv(a, pos + 1);
+        if (minRest < a[pos]) {
+            return minRest;
+        }
+        return a[pos];
+    }
+    
+    public static int min(int[] a) {
+        return minRekursiv(a, 0);
+    }
+    
+    public static int summeRekursiv(int[] a, int pos) {
+        if (pos == a.length - 1) {
+            return a[pos];
+        }
+        return a[pos] + summeRekursiv(a, pos + 1);
+    }
+    
+    public static int summe(int[] a) {
+        return summeRekursiv(a, 0);
+    }
+    
+    public static int summe2(int[] a) {
+        if (a.length == 0) {
+            return 0;
+        }
+        return a[0] + summe2(Arrays.copyOfRange(a, 1, a.length));
+    }
+    
+    
+    public static void main(String[] args) {
+
+        tuermeVonHanoi(4, 'A', 'B', 'C');
+        
+        int[] a = {-9, 2, 7, -4, 9, 0, 0, 6, 3, 5, 2, 7, -6, 9};
+        
+        System.out.println(summe2(a));
+/*      
+        System.out.println(ggt(60, 18));
+/*  
+        System.out.println(istPalindrom("Otto"));
+        System.out.println(istPalindrom(""));
+        System.out.println(istPalindrom("hdsjkhdfk"));
+/*      
+        System.out.println(fibonacci(45));
+/**/        
+    }
+
 }