See Quicksort on wikipedia:
Typically, quicksort is significantly
faster in practice than other Θ(nlogn)
algorithms, because its inner loop can
be efficiently implemented on most
architectures, and in most real-world
data, it is possible to make design
choices which minimize the probability
of requiring quadratic time.
Note that the very low memory requirement is a big plus as well.