13.11.

InsertionSort.java

@@ -10,7 +10,7 @@ public class InsertionSort
 { 
  public static void InsertionSort(){
       Random rand = new Random();
-        int [] Array = new int [4];
+        int [] Array = new int [8];
         
         //Array befühlen
         for(int i = 0; i<Array.length; i++){
@@ -20,31 +20,42 @@ public class InsertionSort
       //Array ausgeben
       System.out.println("Array:");
      for(int i = 0; i<Array.length; i++){
-        System.out.println(Array[i]);
+        System.out.print(" " +Array[i]);
         }
         //Vergleichen und Vertauschen
         System.out.println("Sortierter Array:");
-       for(int i = 0; i<Array.length; i++){
-        int Wert = Array[i];
-        int j = i -1 ;
-        while(Array[j] > Wert){
-        Array [j ] = Array[j + 1 ];
-        Array[i] = Array[i -1];
+       for(int i = 1; i<Array.length; i++){
+        int Wert;
         
         
+        while( Array[i-1] > Array[i]){
+        for(int j = i; j >=0; j--){
+        Wert = Array[i];
+        Array [i] = Array[i - 1 ];
+        Array[i - 1] = Wert;
+        
         
         }
-        
         }
-        System.out.println();
-        
         }
+      
+        for(int i = 0; i<Array.length; i++){
+        System.out.print(" " +Array[i]);
+    }
+}
+  
+}
+        
+        
+        
+
+ 
+        
         
         
         
         
         
-        }
 
      
    

SelectionSort.java

@@ -54,8 +54,8 @@ public class SelectionSort
         for(int i = 0; i< Array.length; i++){
         if(Array[i] < Array[x])
         x = i;
-    }
-    return x;
+       }
+        return x;
         }
         }