mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +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>
22 lines
661 B
JavaScript
22 lines
661 B
JavaScript
/*
|
|
* Stooge Sort sorts an array based on divide and conquer principle
|
|
* note the exceptionally bad time complexity
|
|
* more information: https://en.wikipedia.org/wiki/Stooge_sort
|
|
*
|
|
*/
|
|
export function stoogeSort(items, leftEnd, rightEnd) {
|
|
if (items[rightEnd - 1] < items[leftEnd]) {
|
|
const temp = items[leftEnd]
|
|
items[leftEnd] = items[rightEnd - 1]
|
|
items[rightEnd - 1] = temp
|
|
}
|
|
const length = rightEnd - leftEnd
|
|
if (length > 2) {
|
|
const third = Math.floor(length / 3)
|
|
stoogeSort(items, leftEnd, rightEnd - third)
|
|
stoogeSort(items, leftEnd + third, rightEnd)
|
|
stoogeSort(items, leftEnd, rightEnd - third)
|
|
}
|
|
return items
|
|
}
|