Consider an initial equidistribution sorted according to permutation = (n), (n 1), . .

Consider an initial equidistribution sorted according to permutation

π

 =
π(n), π(n − 1), . . . , π(1). Prove that, executing protocol OddEven-LineSort in this case, every data item will change location in each iteration.