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
778 B
JavaScript
26 lines
778 B
JavaScript
import { merge, mergeSort } from '../MergeSort'
|
|
|
|
describe('merge', () => {
|
|
it('should merge arrays correctly', () => {
|
|
expect(merge([5, 4], [1, 2, 3])).toEqual([1, 2, 3, 5, 4])
|
|
expect(merge([], [1, 2])).toEqual([1, 2])
|
|
expect(merge([1, 2, 3], [1])).toEqual([1, 1, 2, 3])
|
|
expect(merge([], [])).toEqual([])
|
|
})
|
|
})
|
|
|
|
describe('MergeSort', () => {
|
|
it('should work for empty arrays', () => {
|
|
expect(mergeSort([])).toEqual([])
|
|
})
|
|
|
|
it('should sort arrays correctly', () => {
|
|
expect(mergeSort([5, 4])).toEqual([4, 5])
|
|
expect(mergeSort([8, 4, 10, 15, 9])).toEqual([4, 8, 9, 10, 15])
|
|
expect(mergeSort([1, 2, 3])).toEqual([1, 2, 3])
|
|
expect(mergeSort([10, 5, 3, 8, 2, 6, 4, 7, 9, 1])).toEqual([
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 10
|
|
])
|
|
})
|
|
})
|