Sorting Algorithms: Quick, Merge, Heap - Typical Problems - Competitive Exam Level

Download Q&A
Q. If an array is already sorted, what is the time complexity of Quick Sort?
  • A. O(n)
  • B. O(n log n)
  • C. O(n^2)
  • D. O(log n)
Showing 1 to 1 of 1 (1 Pages)
Soulshift Feedback ×

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

Not likely Very likely