Java Sort algorithm optimization--shell sort "warm and know new"

/** * * @author Fly/public class Shellsort {public int[] Shellsort (int[] a) {int size = A.length;
                for (int step = SIZE/2, step > 0, Step/= 2) {for (int i = 0; i < step; i++) {
                    for (int j = i; j < size; J + = step) {int temp = a[j], k;
                    for (k = j; k > I && a[k-step] > Temp. K-= Step) {A[k] = A[k-step];
                } A[k] = temp;
    }} 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};
        Shellsort shellsort = new Shellsort ();
        Shellsort.printarray (a);
    Shellsort.printarray (Shellsort.shellsort (a)); }
}