Bitonic sort is a sorting algorithm designed for parallel computers. At each iteration, each memory location only has a single possible swap. The data movement is similar to the butterfly diagrams used in FFTs.

posted by pembo210 on Math

Math