(For the version of the algorithm as presented in this module:) What is the running time of Quicksort when the input is an array where all record values are equal?
\Theta(n^2)\Theta(n)\Theta(\log n)\Theta(n \log n)\Theta(n ^ n)What does the partition step do?
It splits the array into a partition with all values on one side.
This is very bad.