判断题：Quicksort: Running Time on Good Inputs

Consider the randomized quicksort. We have proved that it runs in $$O(n \log n)$$ time in expectation even for the worst input. Is the following statement true of false?

> <font size=3>There exists some good inputs on which the expected running time of randomized quicksort is $$O(n)$$ where $$n$$ is the input size.</font>

答案：FALSE