Sortierung/SelectionSort.java

105 lines
2.2 KiB
Java

/**
* Beschreiben Sie hier die Klasse Sortierung.
*
* @author (Ihr Name)
* @version (eine Versionsnummer oder ein Datum)
*/
import java.util.Random;
public class SelectionSort
{
public static void SelectionSortOutofPlace(){
Random rand = new Random();
int [] Array = new int [8];
//Array befühlen
for(int i = 0; i<Array.length; i++){
Array[i] = rand.nextInt(50);
}
//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++){
if(Minimum > Array[i]){
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;
}
}
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]);
}
}
}