49 lines
1019 B
Java
49 lines
1019 B
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 ArrayToSort = Array[i];
|
|
int j = i;
|
|
while(ArrayToSort < Array[j+1]){
|
|
Array[j] = Array[j-1];
|
|
}
|
|
Array[j] = ArrayToSort;
|
|
System.out.println(ArrayToSort);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|