Answer TRUE or FALSE.
The proof that the lower bound for the
sorting problem is \Omega(n \log n) technically
only applies to comparison-based sorting. This means that we
can find other approaches (such as radix sort) to solve the
problem faster.
Does Radix Sort compare?
While Radix Sort does not directly compare the keys of two records against each other, it does do a comparison for each digit of each key.