Question: how to find time complexity of quicksort algorithm?
Answer: Lemma 2.14 (Textbook): The worst-case time complexity of quicksort is Ω(n2). Proof. The partitioning step: at least, n − 1 comparisons. one less, so that T(n) = T(n − 1) + (n − 1); T(1) = 0.