Sorting Algorithms: Quick, Merge, Heap - Implementations in C++

Download Q&A
Q. In Quick Sort, what is the role of the pivot?
  • A. To divide the array
  • B. To sort the array
  • C. To merge the array
  • D. To find the maximum element
Q. What is the average time complexity of Quick Sort?
  • A. O(n log n)
  • B. O(n^2)
  • C. O(log n)
  • D. O(n)
Showing 1 to 2 of 2 (1 Pages)
Soulshift Feedback ×

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

Not likely Very likely