GeezerVison is showing github.com — merge: Add test case to FlashSort algorithm (#946) · Algorithms-Learn/JavaScript@532cf3e
File treeExpand file treeCollapse file tree Open diff view settings Expand file treeCollapse file tree Open diff view settings Collapse file Copy file name to clipboard +25Lines changed: 25 additions & 0 deletions | Original file line number | Diff line number | Diff line change |
|---|
| | 1 | +import { flashSort } from '../FlashSort' | | 2 | + | | 3 | +test('The flash sort of the array [3, 0, 2, 5, -1, 4, 1, -2] is [-2, -1, 0, 1, 2, 3, 4, 5]', () => { | | 4 | + const array = [3, 0, 2, 5, -1, 4, 1, -2] | | 5 | + const res = flashSort(array) | | 6 | + expect(res).toEqual([-2, -1, 0, 1, 2, 3, 4, 5]) | | 7 | +}) | | 8 | + | | 9 | +test('The flash sort of the array [-3, 0, 2, -5, -1, 4, 1, -2] is [-5, -3, -2, -1, 0, 1, 2, 4]', () => { | | 10 | + const array = [-3, 0, 2, -5, -1, 4, 1, -2] | | 11 | + const res = flashSort(array) | | 12 | + expect(res).toEqual([-5, -3, -2, -1, 0, 1, 2, 4]) | | 13 | +}) | | 14 | + | | 15 | +test('The flash sort of the array [13, 0, 12, 5, -1, 14, 1, -2] is [-2, -1, 0, 1, 5, 12, 13, 14]', () => { | | 16 | + const array = [13, 0, 12, 5, -1, 14, 1, -2] | | 17 | + const res = flashSort(array) | | 18 | + expect(res).toEqual([-2, -1, 0, 1, 5, 12, 13, 14]) | | 19 | +}) | | 20 | + | | 21 | +test('The flash sort of the array [-3, 0, -2, -5, -1, -4, -1, -2] is [-5, -4, -3, -2, -2, -1, -1, 0]', () => { | | 22 | + const array = [-3, 0, -2, -5, -1, -4, -1, -2] | | 23 | + const res = flashSort(array) | | 24 | + expect(res).toEqual([-5, -4, -3, -2, -2, -1, -1, 0]) | | 25 | +}) |
|