cuda并行结构下的冒泡排序

两两比较的冒泡排序

2n-1次 奇数和它右边的比较交换

2n次 偶数和他右边比较交换 

Algorithm 9.3 Sequential odd-even transposition sort algorithm.

1.   procedure ODD-EVEN(n) 
2.   begin 
3.      for i := 1 to n do 
4.      begin 
5.         if i is odd then 
6.              for j := 0 to n/2 - 1 do 
7.                  compare-exchange(a2j + 1, a2