merge: Add test case and fix pigeonHoleSort Algorithm (TheAlgorithms#967)

Ankush263 · web-flow · commit 6f33f990f2c9 · 2022-04-01T12:28:43.000+05:30
diff --git a/Sorts/PigeonHoleSort.js b/Sorts/PigeonHoleSort.js
@@ -29,4 +29,5 @@ export function pigeonHoleSort (arr) {
       arr[index++] = j + min
     }
   }
+  return arr
 }
diff --git a/Sorts/test/pigeonHoleSort.test.js b/Sorts/test/pigeonHoleSort.test.js
@@ -0,0 +1,19 @@
+import { pigeonHoleSort } from '../PigeonHoleSort'
+
+test('The pigeonHoleSort of the array [1, 4, 3, 2] is [1, 2, 3, 4]', () => {
+  const arr = [1, 4, 3, 2]
+  const res = pigeonHoleSort(arr)
+  expect(res).toEqual([1, 2, 3, 4])
+})
+
+test('The pigeonHoleSort of the array [5, 4, 1, 2] is [1, 2, 4, 5]', () => {
+  const arr = [5, 4, 1, 2]
+  const res = pigeonHoleSort(arr)
+  expect(res).toEqual([1, 2, 4, 5])
+})
+
+test('The pigeonHoleSort of the array [18, 31, 29, 35, 11] is [11, 18, 29, 31, 35]', () => {
+  const arr = [18, 31, 29, 35, 11]
+  const res = pigeonHoleSort(arr)
+  expect(res).toEqual([11, 18, 29, 31, 35])
+})

Original file line number	Diff line number	Diff line change
`@@ -29,4 +29,5 @@ export function pigeonHoleSort (arr) {`
`29`	`29`	`arr[index++] = j + min`
`30`	`30`	`}`
`31`	`31`	`}`
	`32`	`+ return arr`
`32`	`33`	`}`