Algorithm 1 OddEvenSort
1:procedure OddEvenSort(A,n)
2:sorted← false
3:while not sorted do
4:sorted← true
5:for i←1 to n−2, i←i+2 do
6:if A[i]>A[i+1] then
7:swap(A[i], A[i+1])
8:sorted← false
9:end if
10:end for
11:for i←0 to n−2, i←i+2 do
12:if A[i]>A[i+1] then
13:swap(A[i], A[i+1])
14:sorted← false
15:end if
16:end for
17:end while
18:end procedure