1- Consider the following functions. (2.5 marks) 1. n 2. glog n 3. 2*3 4. 3*...

 

Transcribed Image Text:

1- Consider the following functions. (2.5 marks) 1. n 2. glog n 3. 2*3" 4. 3* n 5. 3*2" Order the above functions according to their asymptotic complexity. Start with the function having the smallest asymptotic complexity and move on to the function having the next largest one. That is, write them as a sequence f1,f2....f9 such that f1(n) = 0(f2(n)),f2(n) = 0(f3(n)),etc. Indicate as well functions f,g that are asymptotically equivalent, that is, where both f(n) =0(g(n)) and g(n) = 0(f(n)) hold. 1- Consider the following functions. (2.5 marks) 1. n 2. glog n 3. 2*3" 4. 3* n 5. 3*2" Order the above functions according to their asymptotic complexity. Start with the function having the smallest asymptotic complexity and move on to the function having the next largest one. That is, write them as a sequence f1,f2....f9 such that f1(n) = 0(f2(n)),f2(n) = 0(f3(n)),etc. Indicate as well functions f,g that are asymptotically equivalent, that is, where both f(n) =0(g(n)) and g(n) = 0(f(n)) hold.

Answer rating: 100% (QA)

To order the given functions based on their asymptotic complexity we will analyze eac... View the full answer