0 votes 0 votes Given below are 4 functions $999999n$ $0.99999 n logn$ $1.000001^{n}$ $n^{2}$ The increasing order of the above functions in terms of their asymptotic complexity is? Algorithms algorithms asymptotic-notation made-easy-test-series + – snaily16 asked Jan 9, 2019 retagged Jul 8, 2022 by Lakshman Bhaiya snaily16 563 views answer comment Share Follow See 1 comment See all 1 1 comment reply Ashwani Kumar 2 commented Dec 21, 2019 reply Follow Share We have linear, logarithmic, quadratic and exponential function. Among them exponential have higher rate of growth. $1<2<4<3$ 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes order is 1, 2 ,4, 3 1997_satya answered Jan 10, 2019 1997_satya comment Share Follow See all 2 Comments See all 2 2 Comments reply snaily16 commented Jan 10, 2019 reply Follow Share can you explain? plzz 0 votes 0 votes Ram Swaroop commented Dec 21, 2019 i edited by Ram Swaroop Dec 21, 2019 reply Follow Share 3should be highest because it's exponential function 2 logarithmic 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes I hope the explanation is clear. preeti0448 answered May 2, 2022 preeti0448 comment Share Follow See all 0 reply Please log in or register to add a comment.