Quick Sort's time complexity depends largely on the choice of the _______ element.

  • Maximum
  • Median
  • Minimum
  • Pivot
Quick Sort's time complexity depends largely on the choice of the pivot element. The efficiency of the algorithm is highly influenced by selecting a pivot that divides the array into balanced subarrays, reducing the number of comparisons and swaps.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *