0What is the worst case running time of quick sort algorithm?AΘ(x log2x2)BΘ(x)CΘ(x log2x)DΘ(x2) Correct answer: D ExplanationIn the worst case quick sort picks a bad pivot every time and splits the array into n–1 and 0 elements, so the running time is Θ(n²). Join the discussion Report an error Share