freverda
/
Sortierung
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Ubgrade 10.11

master
freverda 2022-11-10 15:49:11 +01:00
parent 3317848e25
commit 075bc6ada3
1 changed files with 58 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

71
Sortierung.java
View File

@ -10,7 +10,7 @@ public class Sortierung
{ {
public static void Sortierverfahren(){ public static void SelectionSortOutofPlace(){
Random rand = new Random(); Random rand = new Random();
int [] Array = new int [8]; int [] Array = new int [8];
@ -19,10 +19,11 @@ public class Sortierung
Array[i] = rand.nextInt(50); Array[i] = rand.nextInt(50);
} }
//Array ausgeben //Array ausgeben
for(int i = 0; i < Array.length; i++){ System.out.println("Array:");
System.out.println(Array[i]); for(int i = 0; i<Array.length; i++){
} System.out.println(+Array[i]);
}
//Minimum finden //Minimum finden
int Minimum = Array[0]; int Minimum = Array[0];
for(int i = 0; i<Array.length; i++){ for(int i = 0; i<Array.length; i++){
@ -30,9 +31,14 @@ public class Sortierung
Minimum = Array[i]; Minimum = Array[i];
} }
} }
//Maximum finden
//sortieren //sortieren
System.out.println("Sortierter Array:"); System.out.println("Sortierter Array:");
for(int i = 0; i<Array.length; i++){ for(int i = 0; i<Array.length; i++){
int m = MinimumPosition[Array];
System.out.println(Array[m]);
Array[m] = 1;
} }
@ -40,22 +46,55 @@ public class Sortierung
}
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;
}
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]);
}
} }
//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;
}
return MinimumIndex;
}
} }