奇偶交换排序是另一种交换排序。它的第一趟对序列中的所有奇数项i扫描，第二趟对序列中的所有偶数项i扫描。若A[i] > A[i+1]，则交换它们。第三趟有对所有的奇数项，第四趟对所有的偶数项，…，如此反复，直到整个序列全部排好序为止。-Parity exchange swap is another sort. It' s the first trip of a sequence of all odd items i scan, the second trip of a sequence of all the even-numbered items i scan. When A [i]>　A [i+1], then the switch them. The third trip there for all the odd items, the fourth trip for all the even-numbered items, ..., and so forth, until the entire sequence all sorted so far.