Are you sure you're getting this? Is this statement true or false?
Before we proceed, let's check your understanding of sorting algorithms.
The recurrence and time complexity for worst case of the QuickSort algorithm is T(n-1) + O(n) and O(n^2) respectively.
Press true if you believe the statement is correct, or false otherwise.
OUTPUT
Results will appear here.