A

Admin • 833K Points
Coach

Q. 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)

Explanation by: Admin

the worst case performance of a quick sort algorithm is mathematically found to be o(n2).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.