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>
35 lines
887 B
JavaScript
35 lines
887 B
JavaScript
/*
|
||
odd–even sort or odd–even transposition sort
|
||
is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections.
|
||
It is a comparison sort related to bubble sort, with which it shares many characteristics.
|
||
|
||
for more information : https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort
|
||
*/
|
||
|
||
// Helper function to swap array items
|
||
function swap(arr, i, j) {
|
||
const tmp = arr[i]
|
||
arr[i] = arr[j]
|
||
arr[j] = tmp
|
||
}
|
||
|
||
export function oddEvenSort(arr) {
|
||
let sorted = false
|
||
while (!sorted) {
|
||
sorted = true
|
||
for (let i = 1; i < arr.length - 1; i += 2) {
|
||
if (arr[i] > arr[i + 1]) {
|
||
swap(arr, i, i + 1)
|
||
sorted = false
|
||
}
|
||
}
|
||
for (let i = 0; i < arr.length - 1; i += 2) {
|
||
if (arr[i] > arr[i + 1]) {
|
||
swap(arr, i, i + 1)
|
||
sorted = false
|
||
}
|
||
}
|
||
}
|
||
return arr
|
||
}
|