QuickSort’s randomized variant has a running time of O(n log n), making it a quasilinear algorithm. Quasilinear time algorithms are represented by the notation O(n log n) or O(n logk n) for some positive constant k. Quasilinear time algorithms have a faster growth rate than linear time algorithms as the input size increases, leading to better performance for large datasets.