What is the worst case time complexity of a quick sort algorithm?
(a) O(N)
(b) O(N log N)
(c) O(N^2)
(d) O(log N)
I have been asked this question during an interview for a job.
Origin of the question is Quicksort topic in section Sorting of Data Structures & Algorithms II