diff --git a/src/main/java/sortalgorithms/Sort.java b/src/main/java/sortalgorithms/Sort.java
index 6cfc0c6..ecb1ee6 100644
--- a/src/main/java/sortalgorithms/Sort.java
+++ b/src/main/java/sortalgorithms/Sort.java
@@ -35,6 +35,21 @@ public int[] bubbleSort(int[] inputArray){
 
     }
 
+     public int[] insertionSort(int [] array) {
+        
+        int n = array.length;  
+        for (int j = 1; j < n; j++) {  
+            int key = array[j];  
+            int i = j-1;  
+            while ( (i > -1) && ( array [i] > key ) ) {  
+                array [i+1] = array [i];  
+                i--;  
+            }  
+            array[i+1] = key;  
+        }  
+        return array;
+    }
+
     public Sort(int[] inputArray) {
         this.inputArray = inputArray;
     }
diff --git a/src/main/java/sortalgorithms/Test.java b/src/main/java/sortalgorithms/Test.java
index 7607fc7..35df2c4 100644
--- a/src/main/java/sortalgorithms/Test.java
+++ b/src/main/java/sortalgorithms/Test.java
@@ -12,8 +12,9 @@ public static void main(String[] args) {
         Sort doSort=new Sort(inputs);
         System.out.println(Arrays.toString(doSort.bubbleSort(inputs)));
 
-
-
+        inputs=new int[]{90,32,19,18,4,1};
+        doSort=new Sort(inputs);
+        System.out.println(Arrays.toString(doSort.insertionSort(inputs)));
 
 
     }