sortierung out of place
parent
5998e5bcff
commit
05c11be94d
|
@ -17,6 +17,7 @@ class Sortierung
|
|||
System.out.println("x: " + x);
|
||||
System.out.println("y: " + y);
|
||||
}
|
||||
|
||||
public static void Zufallsgenerator(){
|
||||
Random r = new Random();
|
||||
int[] arr = new int[20];
|
||||
|
@ -27,9 +28,24 @@ class Sortierung
|
|||
for(int i=0; i< arr.length; i++){ //um Arrays auszugeben nacheinander
|
||||
System.out.print(arr[i] + ",");
|
||||
}
|
||||
// Sortierte Ausgabe
|
||||
int[] sortiert = new int[arr.length];
|
||||
|
||||
System.out.println(" "); //Lehrzeile
|
||||
//Minimumsuche
|
||||
for(int i=0; i<arr.length;i++){
|
||||
//Minimum finden
|
||||
int index = Minimum(arr);
|
||||
//Minimum an richtige Stelle
|
||||
sortiert[i] = arr[index];
|
||||
//Minimum überschreiben
|
||||
arr[index] = 99;
|
||||
}
|
||||
System.out.println(); //Lehrzeile
|
||||
for(int i=0; i< arr.length; i++){ //um Arrays auszugeben sortiert
|
||||
System.out.print(sortiert[i] + ",");
|
||||
}
|
||||
}
|
||||
|
||||
public static int Minimum(int[] arr){ //Minimumsuche
|
||||
int min = arr[0];
|
||||
int index = 0;
|
||||
for(int i=0; i< arr.length; i++){
|
||||
|
@ -38,7 +54,8 @@ class Sortierung
|
|||
index = i;
|
||||
}
|
||||
}
|
||||
System.out.println("Minimum: " + min);
|
||||
System.out.println("Index: " + index);
|
||||
return index;
|
||||
}
|
||||
|
||||
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue