When is Quicksort a good choice for sorting an array?
In most standard situations where you want
to sort many records
- Each record requires a large amount of memory
- Each record requires a small amount of memory
- The processor speed is fast
- We need a reasonably fast algorithm with a good worst case
Quicksort doesn't change its performance based on record
size.
What are Quicksort's average and worst case costs?
Quicksort's strength is its average case cost, not its
worst case cost.