import java.lang.*;
import java.io.*;
import java.util.Scanner;
import java.util.*;

public class Insertsort {

    public static void main(String[] args) {

    int lae;
    Scanner scanner = new Scanner(System.in);
    System.out.print("Wie viele Feldelemente sollen erzeugt werden?     ");
    lae = scanner.nextInt();
    System.out.println(lae);
    scanner.close();

    Random rnd = new Random();
    int min;
    int A[];
    int ind = 0;


    //Füllen
    A = new int [lae];

    for(int z = 0; z < A.length; z++){
      A[z] = rnd.nextInt(100);
      }

    for(int i = 0;i < A.length;i++){
      System.out.print(A[i] + " | ");
    }

    //Suche nach Minimum
      min = A[0];
    for (int o = 0; o <= A.length-1; o++) {
      if (A[o] <= min) {
        min = A[o];
        ind = o;
      }

    }
    System.out.println();
    System.out.println();
    System.out.println("MINIMUM: " + min);
    System.out.println("INDEX DES MINIMUMS: " + ind);
    System.out.println();

    //Verschieben
    int k=0;
    int j=1;
    for (int p = 0; p < ind  ;p++ ) {
      A[ind-k] = A[ind-j];
      k++;
      j++;
    } // end of for


    A[0] = min;

    for(int b = 0;b < A.length;b++){
      System.out.print(A[b] + " | ");
    }
    }
}