algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 16:26:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

merge: Add test case to HeapSort Algorithm (#947)

Browse Source
This commit is contained in:
Ankush263
2022-03-24 21:50:57 +05:30
committed by GitHub
parent 73efc89d29
commit 55da7a1d7c
1 changed files with 25 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
Sorts/test/HeapSort.test.js Normal file
View File

@ -0,0 +1,25 @@
import { heapSort } from '../HeapSort'
test('The HeapSort of the array [5, 4, 3, 2, 1] is [1, 2, 3, 4, 5]', () => {
const array = [5, 4, 3, 2, 1]
const res = heapSort(array)
expect(res).toEqual([1, 2, 3, 4, 5])
})
test('The HeapSort of the array [-5, -4, -3, -2, -1] is [-5, -4, -3, -2, -1]', () => {
const array = [-5, -4, -3, -2, -1]
const res = heapSort(array)
expect(res).toEqual([-5, -4, -3, -2, -1])
})
test('The HeapSort of the array [50, 43, 31, 52, 91] is [31, 43, 50, 52, 91]', () => {
const array = [50, 43, 31, 52, 91]
const res = heapSort(array)
expect(res).toEqual([31, 43, 50, 52, 91])
})
test('The HeapSort of the array [] is []', () => {
const array = []
const res = heapSort(array)
expect(res).toEqual([])
})