search
Log In
0 votes
109 views

Given below are 4 functions

  1. $999999n$
  2. $0.99999 n logn$
  3. $1.000001^{n}$
  4. $n^{2}$

The increasing order of the above functions in terms of their asymptotic complexity is?

in Algorithms 109 views
0
We have linear, logarithmic, quadratic and exponential function. Among them exponential have higher rate of growth.

$1<2<4<3$

1 Answer

0 votes
order is 1, 2 ,4, 3
0
can you explain? plzz
0
3should be highest because it's exponential function

2 logarithmic

Related questions

2 votes
1 answer
1
216 views
Find the time complexity of the following recurrance relation: T(n) = T(n - 1) + sin(n) , 'n' is measured in degree(s) Options are: A) $theta$(n) B) $theta$(1) C) $theta$(logn) D) $theta$(n.logn)
asked Nov 8, 2016 in Algorithms Sushant Gokhale 216 views
1 vote
1 answer
2
144 views asked Nov 19, 2017 in Algorithms kamakshi 144 views
0 votes
0 answers
3
160 views
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?
asked Jan 6, 2019 in Algorithms Markzuck 160 views
0 votes
0 answers
4
243 views
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c, like cant we take both the recurrance call as combined as both have same parameter? and if not, then how to solve such?
asked Dec 29, 2018 in Algorithms Markzuck 243 views
...