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
755 B
JavaScript
26 lines
755 B
JavaScript
import { heapSort } from '../HeapSort'
|
|
|
|
test('The HeapSort of the array [5, 4, 3, 2, 1] is [1, 2, 3, 4, 5]', () => {
|
|
const array = [5, 4, 3, 2, 1]
|
|
const res = heapSort(array)
|
|
expect(res).toEqual([1, 2, 3, 4, 5])
|
|
})
|
|
|
|
test('The HeapSort of the array [-5, -4, -3, -2, -1] is [-5, -4, -3, -2, -1]', () => {
|
|
const array = [-5, -4, -3, -2, -1]
|
|
const res = heapSort(array)
|
|
expect(res).toEqual([-5, -4, -3, -2, -1])
|
|
})
|
|
|
|
test('The HeapSort of the array [50, 43, 31, 52, 91] is [31, 43, 50, 52, 91]', () => {
|
|
const array = [50, 43, 31, 52, 91]
|
|
const res = heapSort(array)
|
|
expect(res).toEqual([31, 43, 50, 52, 91])
|
|
})
|
|
|
|
test('The HeapSort of the array [] is []', () => {
|
|
const array = []
|
|
const res = heapSort(array)
|
|
expect(res).toEqual([])
|
|
})
|