65 lines
1.1 KiB
Java
65 lines
1.1 KiB
Java
|
|
/**
|
|
* Beschreiben Sie hier die Klasse InsertionSort.
|
|
*
|
|
* @author (Ihr Name)
|
|
* @version (eine Versionsnummer oder ein Datum)
|
|
*/
|
|
import java.util.Random;
|
|
public class InsertionSort
|
|
{
|
|
public static void InsertionSort(){
|
|
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.print(" " +Array[i]);
|
|
}
|
|
//Vergleichen und Vertauschen
|
|
System.out.println("Sortierter Array:");
|
|
for(int i = 1; i<Array.length; i++){
|
|
int Wert;
|
|
|
|
|
|
while( Array[i-1] > Array[i]){
|
|
for(int j = i; j >=0; j--){
|
|
Wert = Array[i];
|
|
Array [i] = Array[i - 1 ];
|
|
Array[i - 1] = Wert;
|
|
|
|
|
|
}
|
|
}
|
|
}
|
|
|
|
for(int i = 0; i<Array.length; i++){
|
|
System.out.print(" " +Array[i]);
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|