diff --git a/Sortierung.java b/Sortierung.java
index 319247d..657b97c 100644
--- a/Sortierung.java
+++ b/Sortierung.java
@@ -10,7 +10,7 @@ public class Sortierung
 
 {
      
-    public static void Sortierverfahren(){
+    public static void SelectionSortOutofPlace(){
         Random rand = new Random();
         int [] Array = new int [8];
         
@@ -19,10 +19,11 @@ public class Sortierung
         Array[i] = rand.nextInt(50);
         
         }
-        //Array ausgeben
-        for(int i = 0; i < Array.length; i++){
-        System.out.println(Array[i]);
-    }
+      //Array ausgeben
+      System.out.println("Array:");
+     for(int i = 0; i<Array.length; i++){
+        System.out.println(+Array[i]);
+        }
     //Minimum finden
     int Minimum = Array[0];
     for(int i = 0; i<Array.length; i++){
@@ -30,33 +31,71 @@ public class Sortierung
     Minimum = Array[i];
     }
     }
+    //Maximum finden
+   
      //sortieren
      System.out.println("Sortierter Array:");
     for(int i = 0; i<Array.length; i++){
-    
-    
+    int m = MinimumPosition[Array];
+    System.out.println(Array[m]);
+    Array[m] = 1;
+        
+        
     }
         
-        
-    
-        
          
          
         
         }
     
-        //Minimum Index festlegen
-        public static int MinimumIndex(int Array[]){
-        int Minimum = Array[0];
-        int MinimumIndex = 0;
-        for(int i = 0; i<Array.length; i++)
-        if(Array[i]< Minimum){
-        Minimum = Array[0];
-        MinimumIndex = i;
+       public static int MinimumPosition(int [] Array){
+        int x = 0;
+        for(int i = 0; i< Array.length; i++){
+        if(Array[i] < Array[x])
+        x = i;
+    }
+    return x;
         }
-        return MinimumIndex;
+
+       
+        public static void SelectionSortInPlace(){ 
+        int [] Array = new int [8];
+        Random rand = new Random();
+        System.out.println("Array");
+        for(int i = 0; i<Array.length; i++){
+        Array[i] = rand.nextInt(50);
+        System.out.println( Array[i]);
+        
         }
         
+        
+        //Suche von Minimumposition
+        System.out.println("Sortierter Array:");
+        for(int i = 0; i<Array.length; i++){
+        int MinimumPosition = i;
+        int Minimum = Array[MinimumPosition];
+        for(int j = i; j<Array.length; j++){
+        if(Array[j]<Minimum){
+        MinimumPosition = j;
+        Minimum = Array[MinimumPosition];
+        }
+        }
+        //Minimume an den Anfang des Arrays setzen
+        if(MinimumPosition!= i){
+        Array[MinimumPosition] = Array[i];
+        Array[i] = Minimum;
+        }
+       
+        System.out.println(Array[i]);
+        }
+        
+        
+        
+        
+        }
+        
+        
+        
     }