Question

If the input array A[] ={ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2}, then what would be the time complexity of quick sort?(not randomize quick sort)​

Answer 1

Answer:

Explanation:

Then one of the partitions will contain no elements and the other partition will contain n − 1 ... When we total up the partitioning times for each level, we get ... (​We subtract 1 because for quicksort, the summation starts at 2, not 1.) ... The former case occurs if the subarray has an odd number of elements and the pivot is right in ...