mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +08:00

* 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>
32 lines
925 B
JavaScript
32 lines
925 B
JavaScript
/**
|
|
* Cocktail Shaker Sort is an algorithm that is a Bidirectional Bubble Sort.
|
|
*
|
|
* The algorithm extends bubble sort by operating in two directions.
|
|
* While it improves on bubble sort by more quickly moving items to the beginning of the list, it provides only marginal
|
|
* performance improvements.
|
|
*
|
|
* Wikipedia (Cocktail Shaker Sort): https://en.wikipedia.org/wiki/Cocktail_shaker_sort
|
|
* Wikipedia (Bubble Sort): https://en.wikipedia.org/wiki/Bubble_sort
|
|
*/
|
|
export function cocktailShakerSort(items) {
|
|
for (let i = items.length - 1; i > 0; i--) {
|
|
let j
|
|
|
|
// Backwards
|
|
for (j = items.length - 1; j > i; j--) {
|
|
if (items[j] < items[j - 1]) {
|
|
;[items[j], items[j - 1]] = [items[j - 1], items[j]]
|
|
}
|
|
}
|
|
|
|
// Forwards
|
|
for (j = 0; j < i; j++) {
|
|
if (items[j] > items[j + 1]) {
|
|
;[items[j], items[j + 1]] = [items[j + 1], items[j]]
|
|
}
|
|
}
|
|
}
|
|
|
|
return items
|
|
}
|