Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
40 changes: 40 additions & 0 deletions Sorts/OddEvenSort.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
/*
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
}

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
}
}
}
}
const testArray = [5, 6, 7, 8, 1, 2, 12, 14, 5, 3, 2, 2]

// Array before sort
console.log(testArray)
oddEvenSort(testArray)
// Array after sort
console.log(testArray)