1 votes 1 votes What is the correct order ? Algorithms algorithms time-complexity applied-gate-test-series + – LRU asked Nov 2, 2021 retagged Jul 9, 2022 by Lakshman Bhaiya LRU 363 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 raja11sep answered Nov 2, 2021 selected Nov 3, 2021 by LRU raja11sep comment Share Follow See all 4 Comments See all 4 4 Comments reply Kshitij.twr commented Nov 2, 2021 reply Follow Share For f4, shouldn’t it depend on base (say 2, it will become a polynomial function)? 0 votes 0 votes raja11sep commented Nov 2, 2021 reply Follow Share in place of 2 if you write 1.000000001 still ans will remain same. 2 votes 2 votes Kshitij.twr commented Nov 2, 2021 reply Follow Share I understand what you’re saying, because it’s an exponential. What I meant was the case where base is the same, in that case it is no longer exponential, but polynomial 1 votes 1 votes raja11sep commented Nov 2, 2021 reply Follow Share yes , true. 3 votes 3 votes Please log in or register to add a comment.