Answer:
A.Treats array entries as if they were strings that have same length.
Explanation:
The radix sort treats the array values as the strings.First it compares the LSB(Least Significant Bit) of the array values and then moves to the right one by one upto MSB(Most Significant Bit).So we can say that the radix sort treats the entries of the array as strings and compare them.So the answer is option A.
The amount of data that can be stored in the storage unit.
Answer:
n2.
Explanation:
The function with the time complexity of n2 is the fastest growing function is in terms of square.As n increases the time complexity will grow very rapidly.
n=1 n2=1
n=2 n2=4
n=3 n2=9
n=4 n2=16
n=5 n2=25.
The slowest growing function among them is log n then n and then n log n.
n log n is better than n2.
Answer:
C
Explanation:
If it wasn't in order then the code would fail
