retagged by
363 views

1 Answer

Best answer
4 votes
4 votes

Answer: f4>f2>f3>f1

You can compare asymptotic growth these functions by taking bigger values of n(n→ INFINITE).

Note:

Ignore lower order terms .(Ex: f = n^3 + n^2 + n, here you can ignore n^2 and n.)

The time complexity of the exponential function is always more than time complexity of polynomial function. (ex: 2^(logloglogn) is asymtotically bigger than n^1000000000).

Exponential function - Wikipedia

Polynomial - Wikipedia

Lec 1 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005 - YouTube

selected by

Related questions

1 votes
1 votes
1 answer
1
devilstephen7 asked Sep 20, 2021
492 views
Consider the following function int foo(int n){int p = 1 ;if (n && !(n&(n-1))) return n; while (p<n){p <<= 1;}return p;}What is the worst case time complexity of function...
2 votes
2 votes
1 answer
2
LRU asked Nov 3, 2021
811 views
The time required to determine the minimum element from the max heap of size O(log(n)) is given by
5 votes
5 votes
1 answer
3
LRU asked Nov 5, 2021
644 views
Given the following undirected graph, the cost of the minimal spanning tree of the graph is ____.
0 votes
0 votes
2 answers
4
rsansiya111 asked Nov 2, 2022
1,167 views
In the GO back N ARQ sender is sending the 15 packets to the destination with a window size of 5.Assume every sixth packet while transmission is lost. How many transmiss...