54 lines
1.1 KiB
Java
54 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 [4];
|
|
|
|
//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]);
|
|
}
|
|
//Vergleichen und Vertauschen
|
|
System.out.println("Sortierter Array:");
|
|
for(int i = 0; i<Array.length; i++){
|
|
int Wert = Array[i];
|
|
int j = i -1 ;
|
|
while(j >= 0 && Array[j] >Wert ){
|
|
Array [j] = Array[j + 1];
|
|
|
|
System.out.println(Array[j+1] );
|
|
|
|
}
|
|
while(j>=0 && Array[j] < Wert){
|
|
System.out.print(Array[i]);
|
|
}
|
|
System.out.println();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|