COMPUTATIONAL COMPLEXITY
Question 1.
Reorder the following efficiencies from the smallest to the largest:
a. 2n3 + n5
b. 2000
c. 4n+1
d. n4
e. (n-1)!
f. nlog2(n)
g. 2klogk(n) (k is a predefined constant)
Solution:
Efficiency: a measure of amount of time for an algorithm to execute (Time Efficiency) or a
measure of amount of memory needed for an algorithm to execute (Space Efficiency).
Non-decreasing order: 2000