Function Asymptotic Growth & Basic Java Programming Questions

See Question.pdf

• Question.pdf

The order of growth for each function is given by the dominant term (the term of the highest degree). In order to be easier for ordering the functions by their asymptotic growth rate it is necessary to process some of them.
2^log⁡n = n =O(n) (according the basic properties of Math operations).
2^10=1,024 therefore O(1) (since it is a contant)
4nlog⁡n +2n is O(nlog⁡n)
3n+100log⁡n is O(n)...

This is only a preview of the solution. Please use the purchase button to see the entire solution