The growth of log2(N) functions is always smaller than thegrowth of linear functions, N.
a) Does your timing results, Table Time, demonstrate this factfor all values of N and all algorithms?
b) Does your comparisons analysis, Table Comparisons,demonstrate this fact for all values of N and all algorithms?
Expert Answer
An answer will be send to you shortly. . . . .