What is the worst case complexity of sorting ‘n’ numbers using quick sort method?

  1. θ (n^2)
  2. θ (n log n)
  3. θ (n)
  4. θ ( log n)
Anurag Mishra Professor Asked on 13th January 2016 in Computers.
Add Comment
  • 0 Answer(s)

    Your Answer

    By posting your answer, you agree to the privacy policy and terms of service.