some sorting problems admit a strictly faster solution than the bound for comparison sorting; an example is integer sorting, where all keys are integers. when the keys form a small (compared to ) range, counting sort is an example algorithm that runs in linear time. other integer sorting algorithms, such as radix sort, are not asymptotically faster than comparison sorting, but can be faster in practice.