Declare and implement a new function oddevenSort$()$ by repeatedly making two

passes through the array. On the first pass you look at all the pairs of items, a$[$j$]$ and

a$[$j$+1],$ where j is odd $($j $=1,3,5,...).$ If their key values are out of order, you swap them.

On the second pass you do the same for all the even values $($j $=0,2,4,6,...).$ You do

these two passes repeatedly until the array is sorted.

Given:

$4030105020$

$1$st round:

$4010302050($j $=1,3)$

$2$nd round:

$1040203050($j $=0,2)$

$3$rd round:

$1020403050($j $=1,3)$

$4$th round:

$1020304050($j $=0,2)$

$5$th round:

$1020304050($j $=1,3)($no swap!$)$

$6$th round:

$1020304050($j $=0,2)($no swap!$)$