Shell Sort

Sorting/Shell Sort/ShellSort.java

@@ -0,0 +1,39 @@
+class ShellSort
+{
+    static void printArray(int arr[])
+    {
+        int n = arr.length;
+        for (int i=0; i<n; ++i)
+            System.out.print(arr[i] + " ");
+        System.out.println();
+    }
+    int sort(int arr[])
+    {
+        int n = arr.length;
+        for (int gap = n/2; gap > 0; gap /= 2)
+        {
+            for (int i = gap; i < n; i += 1)
+            {
+                int temp = arr[i];
+                int j;
+                for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
+                    arr[j] = arr[j - gap];
+                arr[j] = temp;
+            }
+        }
+        return 0;
+    }
+
+    public static void main(String args[])
+    {
+        int arr[] = {12, 34, 54, 2, 3};
+        System.out.println("Array before sorting");
+        printArray(arr);
+
+        ShellSort ob = new ShellSort();
+        ob.sort(arr);
+
+        System.out.println("Array after sorting");
+        printArray(arr);
+    }
+}

Sorting/Shell Sort/shell_sort.cpp

@@ -0,0 +1,41 @@
+#include  <iostream>
+using namespace std;
+
+int shellSort(int arr[], int n)
+{
+    for (int gap = n/2; gap > 0; gap /= 2)
+    {
+        for (int i = gap; i < n; i += 1)
+        {
+            int temp = arr[i];
+            int j;            
+            for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
+                arr[j] = arr[j - gap];
+
+            arr[j] = temp;
+        }
+    }
+    return 0;
+}
+
+void printArray(int arr[], int n)
+{
+    for (int i=0; i<n; i++)
+        cout << arr[i] << " ";
+}
+
+int main()
+{
+    int arr[] = {12, 34, 54, 2, 3}, i;
+    int n = sizeof(arr)/sizeof(arr[0]);
+
+    cout << "Array before sorting: \n";
+    printArray(arr, n);
+
+    shellSort(arr, n);
+
+    cout << "\nArray after sorting: \n";
+    printArray(arr, n);
+
+    return 0;
+}

Sorting/Shell Sort/shell_sort_python.py

@@ -0,0 +1,20 @@
+def shellSort(arr, n):
+    gap=n//2
+    while gap>0:
+        j=gap
+        while j<n:
+            i=j-gap 
+            while i>=0:
+                if arr[i+gap]>arr[i]:
+                    break
+                else:
+                    arr[i+gap],arr[i]=arr[i],arr[i+gap]
+                i=i-gap 
+            j+=1
+        gap=gap//2
+
+arr2 = [12, 34, 54, 2, 3]
+print("input array:",arr2)
+
+shellSort(arr2,len(arr2))
+print("sorted array",arr2)