A note on gray code and odd-even merge

@article{Larcher1987ANO,
  title={A note on gray code and odd-even merge},
  author={Gerhard Larcher and Robert F. Tichy},
  journal={Discrete Applied Mathematics},
  year={1987},
  volume={18},
  pages={309-313}
}
Let B[l], . . . . B[N] and C[l],..., C[N] be two sorted arrays which we wish to merge into a single sorted array A[l], . . . , A [2N]. The ‘odd-even merge’ introduced by Batcher [1],[2] is a well-known method for merging in place with a fixed comparison sequence; i.e., no space for the output array is required. To satisfy the in place condition we assume… CONTINUE READING