Quicksort: Choosing the pivot

by

Choosing a random pivot minimizes the chance that you will encounter worst-case O(n2) performance (always choosing first or last would cause worst-case performance for nearly-sorted or nearly-reverse-sorted data). Choosing the middle element would also be acceptable in the majority of cases.

Also, if you are implementing this yourself, there are versions of the algorithm that work in-place (i.e. without creating two new lists and then concatenating them).

More Related Contents:

  1. Why is quicksort better than mergesort?
  2. median of three values strategy
  3. Quicksort vs heapsort
  4. Quicksort superiority over Heap Sort
  5. Sorting (Quicksort) ,Partition
  6. Apply Quicksort to the list M,E,R,G,E,S,O,R,T
  7. What should be the algorithm of the below statement?
  8. Fastest sort of fixed length 6 int array
  9. Is there an O(n) integer sorting algorithm?
  10. Which sort algorithm works best on mostly sorted data? [closed]
  11. Merge Sort a Linked List
  12. Natural Sorting algorithm
  13. Algorithm to separate items of the same type
  14. Compute the minimal number of swaps to order a sequence
  15. Which parallel sorting algorithm has the best average case performance?
  16. Optimal algorithm for returning top k values from an array of length N
  17. Find the paths between two given nodes?
  18. Worst case for QuickSort – when can it occur?
  19. Two Rectangles intersection
  20. Quick Sort Vs Merge Sort [duplicate]
  21. How to rank a million images with a crowdsourced sort
  22. Sort Four Points in Clockwise Order
  23. help in the Donalds B. Johnson’s algorithm, i cannot understand the pseudo code (PART II)
  24. What is a bubble sort good for? [closed]
  25. Sorting in place
  26. Design an efficient algorithm to sort 5 distinct keys in fewer than 8 comparisons
  27. Search a sorted 2D matrix [duplicate]
  28. When is each sorting algorithm used? [closed]
  29. Find the pair across 2 arrays with kth largest sum
  30. Why is Insertion sort better than Quick sort for small list of elements?

Leave a Comment