Once again we compare Bitonic SIMD Sorting against the std::sort() routine provided as part of the C++-17 standard library. The diagram below captured from Vitis Analyzer shows the average # of cycles for each algorithm. A total of 4 random sorting runs were made. The Bitonic sort takes 217,636 total cycles overall. The std::sort() takes 3,157,482 cycles. This gives Bitonic SIMD sorting an advantage of ~14X over std::sort() for this larger array size.