From ce8fd497e80dd645e2c58c0701fe90b6176c5451 Mon Sep 17 00:00:00 2001
From: Ture Bentzin <ture.bentzin@alumni.fh-aachen.de>
Date: Thu, 20 Nov 2025 17:11:13 +0000
Subject: [PATCH] refactor: format java files

---
 Sort.java | 18 ++++++++----------
 1 file changed, 8 insertions(+), 10 deletions(-)

diff --git a/Sort.java b/Sort.java
index 378d815..b7aa726 100644
--- a/Sort.java
+++ b/Sort.java
@@ -7,24 +7,22 @@ public class Sort {
 
     while (array.length != 0) {
       int indexKleinstesElement = 0;
-      for (int index = 1; index < array.length; index++) {
-        if (array[index] < array[indexKleinstesElement]) indexKleinstesElement = index;
-      }
+      for (int index = 1; index < array.length; index++)
+        if (array[index] < array[indexKleinstesElement])
+          indexKleinstesElement = index;
 
       // Add to hilfsarray (at curr pos)
       hilfsArray[hilfsArray.length - array.length] = array[indexKleinstesElement];
-      System.out.println("Sortiere.... hilfsarray: " + Arrays.toString(hilfsArray) + " array: " + Arrays.toString(array));
+      System.out
+          .println("Sortiere.... hilfsarray: " + Arrays.toString(hilfsArray) + " array: " + Arrays.toString(array));
 
       // Refill array
       int[] newArray = new int[array.length - 1];
 
       // i = index in array, j = index in newArray
-      for (int i = 0, j = 0; i < array.length; i++ ) {
-        if (i != indexKleinstesElement) {
-          newArray[j] = array[i];
-          j++;
-        }
-      }
+      for (int i = 0, j = 0; i < array.length; i++)
+        if (i != indexKleinstesElement)
+          newArray[j++] = array[i];
       array = newArray;
     }
     return hilfsArray;