diff --git a/Sorting/Pigeonhole_Sort.js b/Sorting/Pigeonhole_Sort.js
new file mode 100644
index 00000000..870bfb26
--- /dev/null
+++ b/Sorting/Pigeonhole_Sort.js
@@ -0,0 +1,49 @@
+//taking dynamic input array to be sorted
+var i;
+var n=prompt("enter the size of your array");
+var arr = [];
+for(i=0; i<n; i++) 
+{
+    //Taking Input from user
+    arr[i] = prompt('Enter Element ' + (i+1));
+}
+//function for pigeonsort
+function pigeonsort(array)
+{
+    //finding maximum value of array 
+    var max = Math.max.apply(null,array); //19
+
+    //finding minimum value of array 
+    var min = Math.min.apply(null,array); //2
+
+    //finding the size of hole array to be created
+    var holerange=max-min+1;
+
+    //initialising hole array with value 0
+    var hole = Array(holerange).fill(0);
+
+    //filling the hole array
+    for(i=0;i<array.length;i++)
+    {
+        hole[array[i]-min]++;
+    }
+
+    count = 0;
+
+    //finally putting the values in sorted manner
+    for(var j = 0 ; j<holerange ; j++)
+    {
+        while(hole[j]!==0)
+        {
+            array[count]=j+min;
+            hole[j]--;
+      	    count++;
+    	}
+    }
+    return array;
+}
+
+console.log(pigeonsort(arr));
+
+//input -  [19,9,2,3,8,12,10]
+//output - [2,3,8,9,10,12,19]