Note that comparison sorts may run faster on some lists; many adaptive sorts such as insertion sort run in O(n) time on an already-sorted or nearly-sorted list.
Balanced ternary notation allows comparisons to be made in one step, whose result will be one of "less than", "greater than" or "equal to".