diff --git a/java/sorting/InsertionSort.java b/java/sorting/InsertionSort.java
new file mode 100644
index 000000000..1fe88e692
--- /dev/null
+++ b/java/sorting/InsertionSort.java
@@ -0,0 +1,28 @@
+public class InsertionSort {
+    public static void Insertion(int arr[]) {
+        for (int i = 1; i < arr.length; i++) {
+            int curr = arr[i]; // storing current position temporarily
+            int prev = i - 1;
+
+            while (prev >= 0 && arr[prev] > curr) {// finding out the correct position
+                arr[prev + 1] = arr[prev];
+                prev--;
+            }
+            arr[prev + 1] = curr;
+
+        }
+    }
+
+    public static void printArry(int arr[]) {
+        for (int j = 0; j < arr.length; j++) {
+            System.out.print(arr[j] + " ");
+        }
+        System.out.println();
+    }
+
+    public static void main(String args[]) {
+        int arr[] = { 5, 4, 1, 3, 2 };
+        Insertion(arr);
+        printArry(arr);
+    }
+}
diff --git a/java/sorting/Shell_sort.java b/java/sorting/Shell_sort.java
new file mode 100644
index 000000000..4db1e242d
--- /dev/null
+++ b/java/sorting/Shell_sort.java
@@ -0,0 +1,51 @@
+public class Shell_sort {
+    static void printArray(int arr[]) {
+        int n = arr.length;
+        for (int i = 0; i < n; ++i)
+            System.out.print(arr[i] + " ");
+        System.out.println();
+    }
+
+    /* function to sort arr using shellSort */
+    int sort(int arr[]) {
+        int n = arr.length;
+
+        // Start with a big gap, then reduce the gap
+        for (int gap = n / 2; gap > 0; gap /= 2) {
+            // Do a gapped insertion sort for this gap size.
+            // The first gap elements a[0..gap-1] are already
+            // in gapped order keep adding one more element
+            // until the entire array is gap sorted
+            for (int i = gap; i < n; i += 1) {
+                // add a[i] to the elements that have been gap
+                // sorted save a[i] in temp and make a hole at
+                // position i
+                int temp = arr[i];
+
+                // shift earlier gap-sorted elements up until
+                // the correct location for a[i] is found
+                int j;
+                for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
+                    arr[j] = arr[j - gap];
+
+                // put temp (the original a[i]) in its correct
+                // location
+                arr[j] = temp;
+            }
+        }
+        return 0;
+    }
+
+    // Driver method
+    public static void main(String args[]) {
+        int arr[] = { 12, 34, 54, 2, 3 };
+        System.out.println("Array before sorting");
+        printArray(arr);
+
+        Shell_sort ob = new Shell_sort();
+        ob.sort(arr);
+
+        System.out.println("Array after sorting");
+        printArray(arr);
+    }
+}