I think his argument goes as follows. If you have N numbers in memory, then you have to use pointers of size log N bits. Because pointers use the same number of bits as numbers, this means that the numbers have to be log N bits. Because radix sort does one O(N) pass per bit, this means that total time will be O(NlogN).<p>If we sort numbers of a fixed, known, size <i>w&#x27;</i>, that is independent of machine word size <i>w</i>, then the argument breaks.