A randomized Quicksort algorithm has an $$O(N \log N)$$ expected

A randomized Quicksort algorithm has an $$O(N \log N)$$ expected running time, only if all the input permutations are equally likely. ~@[](2)

答案：FALSE