今天看到一个排序算法叫奇偶排序:http://www.cnblogs.com/kkun/a...
我不明白的是为什么说奇偶排序在多核环境下效率会高呢?
学到了，这个方法看起来很简单实用啊，就像一个传送带。帮顶一下，也期待大神过来解答
On parallel processors, with one value per processor and only local left–right neighbor connections, the processors all concurrently do a compare–exchange operation with their neighbors, alternating between odd–even and even–odd pairings. wiki
原版的算法是一个处理器一个值才可以快起来吧。
StackOverflow上有大神解释，不过我看不懂。