Question: Q1. [20 marks] Sort the functions below in ascending order of growth rate and justify your answer using big-O notation. - fi(n) = n +
![Q1. [20 marks] Sort the functions below in ascending order of](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3e21144bd3_15266f3e210d9561.jpg)
Q1. [20 marks] Sort the functions below in ascending order of growth rate and justify your answer using big-O notation. - fi(n) = n + n/2 + n/4+ n/8 + n/16 +... - f2(n) = n + 2 + f2(n 1) when n > 1, f2(1) = 1 - f(n) = n* (n 1) * (n - 2) *...* 3 * 2 * 1 - f(n) = 2 + f([n/2]) when n > 1, f(1) = 1 - f(n) = n1.5, fo(n) = (1 +1)", f(n) = 2" +
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
