forked from TheAlgorithms/JavaScript
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathOddEvenSort.js
More file actions
Latest commit
34 lines (31 loc) · 889 Bytes
/
Copy pathOddEvenSort.js
File metadata and controls
34 lines (31 loc) · 889 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/*
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
functionswap(arr,i,j){
consttmp=arr[i]
arr[i]=arr[j]
arr[j]=tmp
}
exportfunctionoddEvenSort(arr){
letsorted=false
while(!sorted){
sorted=true
for(leti=1;i<arr.length-1;i+=2){
if(arr[i]>arr[i+1]){
swap(arr,i,i+1)
sorted=false
}
}
for(leti=0;i<arr.length-1;i+=2){
if(arr[i]>arr[i+1]){
swap(arr,i,i+1)
sorted=false
}
}
}
returnarr
}