From 9d57ebb7817c473a404224ef43b081bdb272a285 Mon Sep 17 00:00:00 2001
From: Sobottasgithub <patrick.schulze.ofp@gmail.com>
Date: Mon, 17 Nov 2025 07:25:42 +0100
Subject: [PATCH] Fixup

---
 Algorithm.java | 38 ++++++++++++++++++++++++++++++++++++++
 Algorithms     | 38 --------------------------------------
 Main.java      |  7 +++++++
 3 files changed, 45 insertions(+), 38 deletions(-)
 create mode 100644 Algorithm.java
 delete mode 100644 Algorithms

diff --git a/Algorithm.java b/Algorithm.java
new file mode 100644
index 0000000..3e93a50
--- /dev/null
+++ b/Algorithm.java
@@ -0,0 +1,38 @@
+public class Algorithm {
+    // Nr 2
+    public int binarySearch(int[] arr, int left, int right, int target) {
+        if (left > right) {
+            return -1;
+        }
+
+        int mid = left + (right - left) / 2;
+
+        if (arr[mid] == target) {
+            return mid;
+        }
+
+        if (target < arr[mid]) {
+            return binarySearch(arr, left, mid - 1, target);
+        }
+
+        return binarySearch(arr, mid + 1, right, target);
+    }
+
+    // NR 1
+    public int ggt(int m, int n) {
+        while (n != 0) {
+            int rest = m % n;
+            m = n;
+            n = rest;
+        }
+        return m;
+    }
+
+    // NR 3
+    public long potenz(long a, int b) {
+        if (b == 0) {
+            return 1;
+        }
+        return a * potenz(a, b - 1);
+    }
+}
diff --git a/Algorithms b/Algorithms
deleted file mode 100644
index 061ed8d..0000000
--- a/Algorithms
+++ /dev/null
@@ -1,38 +0,0 @@
-public class Algorithm {
-		// Nr 2
-	    public int binarySearch(int[] arr, int left, int right, int target) {
-		    if (left > right) {
-		        return -1;
-		    }
-
-		    int mid = left + (right - left) / 2;
-
-		    if (arr[mid] == target) {
-		        return mid;
-		    }
-
-		    if (target < arr[mid]) {
-		        return binarySearch(arr, left, mid - 1, target);
-		    }
-
-		    return binarySearch(arr, mid + 1, right, target);
-		}
-
-		// NR 1
-		public int ggt(int m, int n) {
-    		while (n != 0) {
-        		int rest = m % n;
-        		m = n;
-        		n = rest;
-    		}
-    		return m;
-		}
-
-		// NR 3
-		public long potenz(long a, int b) {
-    		if (b == 0) {
-        		return 1;
-    		}
-    		return a * potenz(a, b - 1);
-		}
-}
diff --git a/Main.java b/Main.java
index 38b70e5..99676f8 100644
--- a/Main.java
+++ b/Main.java
@@ -5,5 +5,12 @@ public class Main {
             System.out.println("Iterativ" + countDigits.countDigitsIterativ(index));
             System.out.println("Rekursiv" + countDigits.countDigitsRekursiv(index));
         }
+
+        System.out.println("Nr 1 2 & 3:");
+        int[] arr = {1, 2, 4, 7, 9, 12, 15, 18, 20};
+        Algorithm algorithms = new Algorithm();
+        System.out.println("ggt: " + algorithms.ggt(8, 4));
+        System.out.println("binarySearch: " + algorithms.binarySearch(arr, 0, arr.length, 12));
+        System.out.println("potenz: " + algorithms.potenz(4, 4));
     }
 }