A new C++ Quicksort algorithm, called blqsort, has been developed, which outperforms the standard library's `std::sort` function. Blqsort achieves its speed through branchless partitioning, sorting networks for small partitions, and robust pivot selection, making it one of the fastest general-purpose comparison-based sorting algorithms for random data. Benchmarks on Apple M1 and Intel i5-9300H systems show that blqsort significantly outperforms other sorting implementations, with the multithreaded version being roughly three times faster on the M1. The algorithm is available on GitHub under the MIT license, with both C++ and C versions, including multithreaded options, and demonstrates minimal runtime differences between the two language implementations.