Examveda

What is the worst case time complexity of a quick sort algorithm?

A. O(N)

B. O(N log N)

C. O(N2)

D. O(log N)

Answer: Option C


This Question Belongs to Data Structure >> Sorting Algorithms

Join The Discussion

Related Questions on Sorting Algorithms