In general, assuming unique inputs, comparison sorts are expressed in terms of comparisons.
What is the best we can do on the worst case type of input?
What is the best worst-case running time?