@@ -0,0 +1,703 @@
+package com.algorithms.sorting;%0A%0A%0Apublic class Shell %7B%0A%0A    public static void sort(Comparable%5B%5D a) %7B%0A        int N = a.length;%0A%0A        int h = 1;%0A        while (h %3C N / 3) h = 3 * h + 1;%0A%0A        while (h %3C= 1) %7B%0A            for (int i = h; i %3C N; i++) %7B%0A                for (int j = i; j %3E= h; j = j - h) %7B%0A                    if (less(a%5Bj%5D, a%5Bj - h%5D)) exch(a, j, j - 1);%0A                    else break;%0A                %7D%0A            %7D%0A        %7D%0A    %7D%0A%0A    private static boolean less(Comparable v, Comparable w) %7B%0A        return v.compareTo(w) %3C 0;%0A    %7D%0A%0A    private static void exch(Comparable%5B%5D a, int i, int j) %7B%0A        Comparable swap = a%5Bi%5D;%0A        a%5Bi%5D = a%5Bj%5D;%0A        a%5Bj%5D = swap;%0A    %7D%0A%7D%0A

Create code for Shell sort