The average run time and the extra space of Quicksort for sortin

The average run time and the extra space of Quicksort for sorting $$n$$ elements are $$O(n\log n)$$ and $$O(1)$$, respectively. ~@[](2)

答案：FALSE