📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

  • google app store apple app store
  • ✖

      Question

      The time complexity of the best case for QuickSort

      is:
      A O(n²) Correct Answer Incorrect Answer
      B O(n log n) Correct Answer Incorrect Answer
      C O(n) Correct Answer Incorrect Answer
      D O(log n) Correct Answer Incorrect Answer
      E O(n³) Correct Answer Incorrect Answer

      Solution

      When the pivot divides the array evenly, QuickSort achieves O(n log n) performance.

      Practice Next
      ask-question