insertion java

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

import static java.lang.System.*;

/**
 * Created by MOHIT on 31-12-2016.
 */
public class insert {
    public static void main(String arg[]) {
        Scanner sc  = new Scanner(in);
        System.out.print("Enter the Array to be sorted : ");
        String str1 = sc.next();
        String[] strArr = str1.split(",");
        int[] numbers = new int[strArr.length];
        int i=0;
        for (String str2 :strArr) {
            int temp = Integer.parseInt(str2);
            numbers[i] = temp;
            i++;
        }
        numbers = insertionSort(numbers);

        System.out.println("The Array after sorting is : ");
        for(i=0; i<numbers.length; i++){
            System.out.print(numbers[i] + " ");
        }
    }

    private static int[] insertionSort(int[] numbers) {
        int temp;
        for(int i=0; i< numbers.length-1; i++){
            for(int j=i; j > 0 ; j--){
                if(numbers[j-1] > numbers[j]){
                    temp = numbers[j-1];
                    numbers[j-1] = numbers[j];
                    numbers[j] = temp;
                }
            }
        }
        return numbers;
    }
}

/*

Enter the Array to be sorted : 231,3423,35,12,34,54,12,5
The Array after sorting is :
5 12 12 34 35 54 231 3423

*/