In this pane you can explore the benchmark data for the various implemented sorting networks (and std::sort) for different compilers, data types and problem sizes.
The graph shows the execution time for sorting one million random filled arrays of size N sequentially.

All measurements have been taken on an AMD Ryzen 7 2700x @3.70 GHz

Compiler:
Data type: