Files
JavaScript/Sorts/test/QuickSortRecursive.test.js
Roland Hummel 86d333ee94 feat: Test running overhaul, switch to Prettier & reformat everything (#1407)
* 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>
2023-10-04 02:38:19 +05:30

32 lines
1.1 KiB
JavaScript

import { quickSort } from '../QuickSortRecursive'
describe('QuickSortRecursive | Partition In Place Method', () => {
it('Expectedly, throw some error if we pass a non-array input', () => {
expect(() => quickSort('xyz', 0, 2)).toThrow(
'Please input a valid list or array.'
)
expect(() => quickSort(null, 0, 4)).toThrow(
'Please input a valid list or array.'
)
expect(() => quickSort(55, 0, 2)).toThrow(
'Please input a valid list or array.'
)
})
it('Expectedly, the quickSort method will sort the unsorted list in ascending order', () => {
const unSortArray = [5, 9, 3, 4, 6, 2, 0, 1, 7, 8]
const sortedExpectedArray = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
expect(quickSort(unSortArray, 0, unSortArray.length - 1)).toEqual(
sortedExpectedArray
)
})
it('Expectedly, the quickSort method will arrange the list of character values in dictionary order.', () => {
const unSortList = ['d', 'e', 'c', 'a', 'f', 'b']
const sortedExpectedList = ['a', 'b', 'c', 'd', 'e', 'f']
expect(quickSort(unSortList, 0, unSortList.length - 1)).toEqual(
sortedExpectedList
)
})
})