What is the best-case time complexity of Quick Sort?

Practice Questions

1 question
Q1
What is the best-case time complexity of Quick Sort?
  1. O(n)
  2. O(n log n)
  3. O(log n)
  4. O(n^2)

Questions & Step-by-step Solutions

1 item
Q
Q: What is the best-case time complexity of Quick Sort?
Solution: The best-case time complexity of Quick Sort is O(n log n), which occurs when the pivot divides the array into two equal halves.
Steps: 0

Related Questions

Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely