I ran into a question about Quick Sort Algorithm.Suppose in Quick Sort, Partition procedure take C times, (need constant time). if we use random data as input, what is the order (time complexity) of Randomized-Quick Sort?any hint or solution highly appreciated.
Quick Sort Algorithm When Partition is Constant Time
algorithms;algorithm analysis;runtime analysis;quicksort