From 51bb1ca0d854ee7f1fab328e622d0e9d1c38dace Mon Sep 17 00:00:00 2001
From: David <@>
Date: Wed, 19 Oct 2022 10:59:41 +0200
Subject: [PATCH] Upgrade 19.10

---
 Fakultät.java | 49 ++++++++++++++++++++++++++++++++++++++++++++++++-
 1 file changed, 48 insertions(+), 1 deletion(-)

diff --git a/Fakultät.java b/Fakultät.java
index aca1c08..8c3ad5a 100644
--- a/Fakultät.java
+++ b/Fakultät.java
@@ -18,7 +18,54 @@ public class Fakultät
          if (n == 1) return 1;
          if (n == 0) return 0;
          return fibo(n-2) + fibo(n-1);
-        }   
+        } 
+        
+        public static int binom(int n, int k){
+        if (k == 0) return 1;
+        if (k == n) return 1;
+        return binom(n-1, k-1) + binom (n-1, k); 
+        }
+    public static void Array(){
+     double[] arr = new double[10];
+     for(int i = 0; i<arr.length; i++){
+     arr[i] = Math.random();
+    }
+     for (int i=0; i<arr.length; i++){
+        System.out.print(arr[i]);
+        
+        }
+        
+     double summe = 0;
+     for(int j = 0; j<arr.length; j++){
+        summe = summe + arr[j]; 
+        }
+     System.out.println("Summe:" + summe);
+     
+     double min = arr[0];
+     for(int k=0; k<arr.length; k++){
+        if(min > arr[k]){
+        min = arr[k];
+        }
+        }
+     System.out.println("Minimum:" + min);
+     
+     
+     double max = arr[0];
+     for(int l=0; l<arr.length; l++){
+        if(max < arr[l]){
+        max = arr[l];
+        }
+        }
+     System.out.println("Maximum:" + max);
+     
+     
+     for(int z = 0; z == arr.length; z++){
+         
+         
+        
+        }
+     
+    }
 }