Insertion Sort [Java]

package selectionsort;
import java.util.Scanner;

public class SelectionSort
{
    public static void main(String[] args)
    {
        Scanner UserInput = new Scanner(System.in);
        int[] Array;

        System.out.print("How many numbers would you like me to sort? ");
        Array = new int[UserInput.nextInt()];
        System.out.println("Please give me some numbers, seperated with the return key");

        for (int i = 0; i < Array.length; i++)
            Array[i] = UserInput.nextInt();

        for (int i = 0; i < Array.length; i++)
        {
            int MinIndex = i;
            for (int j = i + 1; j < Array.length; j++)
                if (Array[j] < Array[MinIndex]) MinIndex =

            int Temp = Array[i];
            Array[i] = Array[MinIndex];
            Array[MinIndex] = Temp;
        }

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