merge: Add test case and fix HeapSort Algorithm (TheAlgorithms#969)

Ankush263 · web-flow · commit d47555b02685 · 2022-03-31T19:27:44.000+05:30
diff --git a/Sorts/HeapSortV2.js b/Sorts/HeapSortV2.js
@@ -38,4 +38,5 @@ export function heapSort (input) {
 
     heapRoot(input, 0)
   }
+  return input
 }
diff --git a/Sorts/test/HeapSortV2.test.js b/Sorts/test/HeapSortV2.test.js
@@ -0,0 +1,19 @@
+import { heapSort } from '../HeapSortV2'
+
+test('The heapSort of the array [4, 3, 2, 1] is [1, 2, 3, 4]', () => {
+  const arr = [4, 3, 2, 1]
+  const res = heapSort(arr)
+  expect(res).toEqual([1, 2, 3, 4])
+})
+
+test('The heapSort of the array [] is []', () => {
+  const arr = []
+  const res = heapSort(arr)
+  expect(res).toEqual([])
+})
+
+test('The heapSort of the array [41, 31, 32, 31] is [31, 31, 32, 41]', () => {
+  const arr = [41, 31, 32, 31]
+  const res = heapSort(arr)
+  expect(res).toEqual([31, 31, 32, 41])
+})

Original file line number	Diff line number	Diff line change
`@@ -38,4 +38,5 @@ export function heapSort (input) {`
`38`	`38`
`39`	`39`	`heapRoot(input, 0)`
`40`	`40`	`}`
	`41`	`+ return input`
`41`	`42`	`}`