Quicksort

  • In practice, quicksort outperforms merge sort, and it significantly outperforms selection sort and insertion sort.
  • The average-case running time of quicksort is as good as mergesort’s. That’s because the constant factor hidden in the big-Θ notation for quicksort makes mergesort quite faster than mergesort.
  • Not using additional storage.
  • pivot, split point
Example

Quicksort-Example-1


References

Leave a Reply

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