Reviewing the randomized QuickSort in our course, we always sele

Reviewing the randomized QuickSort in our course, we always select a central splitter as a pivot before recursions, make sure that each side contains at least $$n/4$$ elements. However, as the same as the deterministic QuickSort, the **worst case running time** of the randomized QuickSort is still $$O(N^2)$$. ~@[](2)

答案：FALSE