The lower bound is for the number of comparisons we have to perform. If the structure of the data allows us to sort without performing comparisons, then we can sort faster.