Skip to content

Commit ecf7cf9

Browse files
authored
merge: Add test case to countingSort algorithm (TheAlgorithms#943)
1 parent 9681688 commit ecf7cf9

File tree

1 file changed

+25
-0
lines changed

1 file changed

+25
-0
lines changed

Sorts/test/countingSort.test.js

+25
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
import { countingSort } from '../CountingSort'
2+
3+
test('The countingSort of the array [3, 0, 2, 5, 4, 1] is [0, 1, 2, 3, 4, 5]', () => {
4+
const array = [3, 0, 2, 5, 4, 1]
5+
const res = countingSort(array, 0, 5)
6+
expect(res).toEqual([0, 1, 2, 3, 4, 5])
7+
})
8+
9+
test('The countingSort of the array [6, 4, 2, 1, 3, 5] is [1, 2, 3, 4, 5, 6]', () => {
10+
const array = [6, 4, 2, 1, 3, 5]
11+
const res = countingSort(array, 1, 6)
12+
expect(res).toEqual([1, 2, 3, 4, 5, 6])
13+
})
14+
15+
test('The countingSort of the array [11, 14, 12, 15, 16, 13] is [11, 12, 13, 14, 15, 16]', () => {
16+
const array = [11, 14, 12, 15, 16, 13]
17+
const res = countingSort(array, 11, 16)
18+
expect(res).toEqual([11, 12, 13, 14, 15, 16])
19+
})
20+
21+
test('The countingSort of the array [13, 18, 2, 15, 43, 11] is [2, 11, 13, 15, 18, 43]', () => {
22+
const array = [13, 18, 2, 15, 43, 11]
23+
const res = countingSort(array, 2, 43)
24+
expect(res).toEqual([2, 11, 13, 15, 18, 43])
25+
})

0 commit comments

Comments
 (0)