Optimal Sorting Networks

While Bitonic and Odd-Even Merge produce correct sorting networks, they don't minimize the number of comparators. Bert Dobbelaere maintains a comprehensive database of the best-known sorting networks, many of which are provably optimal. For FPGA implementations, fewer comparators means less area and potentially lower latency.