Question:
Algorithm Efficiency: Example Problems
Please help with these 2 problems in algorithm efficiency.
1. Rank the terms of the following function according to their order of growth. Give explanation.
f(n) = 100n100 + 34n + log1000n + 43n + 20.001n/n100
2. Consider the following algorithm where n is a positive integer.
for i←| n/2 | n do
a← n-i
What is the efficiency class of this algorithm? Show your reasoning.