So for I while I've been fascinated with sorting networks because some of them are SIMD-friendly, and also how'd they perform against "traditional" sorting algorithms. The code linked to is an experiment in both evaluating performance of sorting networks and in writing high-performance code in C# (pointers, AVX2 intrinsics). The results are promising: sorting networks sort integer and float arrays 3-6X faster than the built-in `Array.Sort` method for arrays of up to 1M elements.
For reference:<p><a href="https://en.wikipedia.org/wiki/Sorting_network" rel="nofollow">https://en.wikipedia.org/wiki/Sorting_network</a>