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

merge: Add test case to FlashSort algorithm (#946)

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

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

@ -0,0 +1,25 @@
import { flashSort } from '../FlashSort'
test('The flash sort of the array [3, 0, 2, 5, -1, 4, 1, -2] is [-2, -1, 0, 1, 2, 3, 4, 5]', () => {
const array = [3, 0, 2, 5, -1, 4, 1, -2]
const res = flashSort(array)
expect(res).toEqual([-2, -1, 0, 1, 2, 3, 4, 5])
})
test('The flash sort of the array [-3, 0, 2, -5, -1, 4, 1, -2] is [-5, -3, -2, -1, 0, 1, 2, 4]', () => {
const array = [-3, 0, 2, -5, -1, 4, 1, -2]
const res = flashSort(array)
expect(res).toEqual([-5, -3, -2, -1, 0, 1, 2, 4])
})
test('The flash sort of the array [13, 0, 12, 5, -1, 14, 1, -2] is [-2, -1, 0, 1, 5, 12, 13, 14]', () => {
const array = [13, 0, 12, 5, -1, 14, 1, -2]
const res = flashSort(array)
expect(res).toEqual([-2, -1, 0, 1, 5, 12, 13, 14])
})
test('The flash sort of the array [-3, 0, -2, -5, -1, -4, -1, -2] is [-5, -4, -3, -2, -2, -1, -1, 0]', () => {
const array = [-3, 0, -2, -5, -1, -4, -1, -2]
const res = flashSort(array)
expect(res).toEqual([-5, -4, -3, -2, -2, -1, -1, 0])
})