A disadvantage of Quicksort is:

Its worst-case running time is \Theta(n^2)
  • It needs an extra array for auxilliary storage
  • It is stable
  • Its average-case running time is \Theta(n^2)

How does Quicksort do in the worst case?

It requires \Theta(n^2), which is pretty bad.