InsertionSort nochmals geübt

PR2pvl/src/SelectionSort.java

@@ -53,6 +53,76 @@ public class SelectionSort {
 	            System.out.print(data[i] + " ");
 	        System.out.println();
 	    }
+
+
+        public static void selectionsortUebung(int[] arr){
+            int temp;
+
+            for(int i = 0; i<arr.length; i++){
+                temp = arr[i];
+
+                int k=i;
+                while(k<arr.length){
+                    if(arr[k] < temp) temp = arr[k];
+                    k++;
+                }
+                arr[k]=arr[i];
+                arr[i]=temp;
+            }
+
+        }
+
+    public static void selectionsortUebungcgpt(int[] arr) {
+        for (int i = 0; i < arr.length; i++) {
+            int minIndex = i;
+
+            int k = i;
+            while (k < arr.length) {
+                if (arr[k] < arr[minIndex]) {
+                    minIndex = k;
+                }
+                k++; // ❗ ganz wichtig
+            }
+
+            // Tauschen
+            int temp = arr[minIndex];
+            arr[minIndex] = arr[i];
+            arr[i] = temp;
+        }
+    }
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
 	}