Java Sorting algorithm optimization--insert sort "warm to know new"

/** * * @author Fly/public class Insertsort {public int[] Insertsort (int[] a) {int size = A.length;
        Int J;
            for (int i = 1; i < size; i++) {int temp = A[i];
                for (j = 0; J < i; J +) {if (A[i] < a[j]) {break;
            for (int k = i; k > J; k--) {a[k] = a[k-1];
        } A[j] = temp;
    return A;
        Public int[] InsertSort1 (int[] a) {int size = A.length;
            for (int i = 1; i < size; i++) {//mark the element that is currently being compared, that is, the first element in the current unordered array//j is less than a[i] in an ordered array
            int temp = a[i], J;
                The condition that the loop continues is to encounter a larger element than a[i, and if not, the description finds the correct position for (j = i; j > 0 && Temp < a[j-1]; j--) {
            A[J] = a[j-1];
            }//(A[i] value to the found element a[j] = temp;
 In fact, this is a continuous exchange process} return a;   public void PrintArray (int[] a) {for (int i:a) {System.out.print (i + ",");
    } System.out.println ();
        public static void Main (string[] args) {int[] a = {2, 3, 1, 5, 7, 8, 9, 0, 11, 10, 12, 13, 14, 4, 6};
        Insertsort insertsort = new Insertsort ();
        Insertsort.printarray (a);
        Insertsort.printarray (Insertsort.insertsort (a));
    Insertsort.printarray (Insertsort.insertsort1 (a)); }
}