mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 00:01:37 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
26 lines
910 B
JavaScript
26 lines
910 B
JavaScript
import { insertionSortAlternativeImplementation } from '../InsertionSort'
|
|
|
|
describe('insertionSortAlternativeImplementation', () => {
|
|
it('expects to work with empty array', () => {
|
|
expect(insertionSortAlternativeImplementation([])).toEqual([])
|
|
})
|
|
|
|
it('expects to return input array when array.length is less than 2', () => {
|
|
const input = [3]
|
|
expect(insertionSortAlternativeImplementation(input)).toEqual(input)
|
|
})
|
|
|
|
it('expects to return array sorted in ascending order', () => {
|
|
expect(insertionSortAlternativeImplementation([14, 11])).toEqual([11, 14])
|
|
expect(insertionSortAlternativeImplementation([21, 22, 23])).toEqual([
|
|
21, 22, 23
|
|
])
|
|
expect(insertionSortAlternativeImplementation([1, 3, 2, 3, 7, 2])).toEqual([
|
|
1, 2, 2, 3, 3, 7
|
|
])
|
|
expect(insertionSortAlternativeImplementation([1, 6, 4, 5, 9, 2])).toEqual([
|
|
1, 2, 4, 5, 6, 9
|
|
])
|
|
})
|
|
})
|