Radix Sort: Time and Space
Space requirement: ?(m+n), where m is the maximum number of possible values of a subkey.
Time requirement: ?(k ( m + n)), where k is the number of phases.
If we assume m < n, and that k is ?( log N), then the time requirement is ?( n log N). However, depending upon the data to be sorted, we might be able to assume that N is constant, making log N also constant, and then have a time complexity of ?(n).