The best/worst case time complexity of quick sort is :
A. O(n)/O(n2)
B. O(n)/O(n log n)
C. O(n log n)/O(n2)
D. O(n log n)/O(n log n)
Answer:C
The best/worst case time complexity of quick sort is :
A. O(n)/O(n2) B. O(n)/O(n log n) C. O(n log n)/O(n2) D. O(n log n)/O(n log n)