What is the main disadvantage of the basic implementation of Quick Sort?

  • Limited applicability
  • Not in-place
  • Poor performance on small datasets
  • Unstable sorting
The main disadvantage of the basic implementation of Quick Sort is its poor performance on small datasets. While efficient for large datasets, it may not be the best choice for smaller ones due to overhead in the recursive calls and partitioning.
Add your answer
Loading...

Leave a comment

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