What is the average running time of a quick sort algorithm?
|C.||o(n log n)|
|Answer» C. o(n log n)|
|Explanation: the best case and average case analysis of a quick sort algorithm are mathematically found to be o(n log n).|
Login to Continue
It will take less than 2 minutes