What is the worst case time complexity of a quick sort algorithm?
|B.||o(n log n)|
|Answer» C. o(n2)|
|Explanation: the worst case performance of a quick sort algorithm is mathematically found to be o(n2).|
Login to Continue
It will take less than 2 minutes