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 countingSort algorithm (#943)

Browse Source
This commit is contained in:
Ankush263
2022-03-22 20:26:55 +05:30
committed by GitHub
parent 9681688797
commit ecf7cf9fe3
1 changed files with 25 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -0,0 +1,25 @@
import { countingSort } from '../CountingSort'
test('The countingSort of the array [3, 0, 2, 5, 4, 1] is [0, 1, 2, 3, 4, 5]', () => {
const array = [3, 0, 2, 5, 4, 1]
const res = countingSort(array, 0, 5)
expect(res).toEqual([0, 1, 2, 3, 4, 5])
})
test('The countingSort of the array [6, 4, 2, 1, 3, 5] is [1, 2, 3, 4, 5, 6]', () => {
const array = [6, 4, 2, 1, 3, 5]
const res = countingSort(array, 1, 6)
expect(res).toEqual([1, 2, 3, 4, 5, 6])
})
test('The countingSort of the array [11, 14, 12, 15, 16, 13] is [11, 12, 13, 14, 15, 16]', () => {
const array = [11, 14, 12, 15, 16, 13]
const res = countingSort(array, 11, 16)
expect(res).toEqual([11, 12, 13, 14, 15, 16])
})
test('The countingSort of the array [13, 18, 2, 15, 43, 11] is [2, 11, 13, 15, 18, 43]', () => {
const array = [13, 18, 2, 15, 43, 11]
const res = countingSort(array, 2, 43)
expect(res).toEqual([2, 11, 13, 15, 18, 43])
})