64 lines
1.2 KiB
Java
64 lines
1.2 KiB
Java
|
|
/**
|
|
* Beschreiben Sie hier die Klasse Sortierung.
|
|
*
|
|
* @author (Ihr Name)
|
|
* @version (eine Versionsnummer oder ein Datum)
|
|
*/
|
|
import java.util.Random;
|
|
public class Sortierung
|
|
|
|
{
|
|
|
|
public static void Sortierverfahren(){
|
|
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
|
|
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];
|
|
}
|
|
}
|
|
//sortieren
|
|
System.out.println("Sortierter Array:");
|
|
for(int i = 0; i<Array.length; 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;
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|