Matt Gallagherless info
|visits||member for||2 years, 1 month|
|seen||Jul 29 '13 at 3:34|
|bio||website||cocoawithlove.com||visits||member for||2 years, 1 month|
|location||Melbourne, Australia||seen||Jul 29 '13 at 3:34|
Why is quicksort better than other sorting algorithms in practice?
@B Seven: to simplify a lot… for an O(n log n) sort algorithm, there are (n log n) iterations of the sorting loop in order to sort n items. The coefficient is how long each cycle of the loop takes. When n is really big (at least thousands), coefficient doesn't matter as much as O() even if the coefficient is huge. But when n is small, coefficient matters – and can be the most important thing if you're only sorting 10 items.