The Gateway to Computer Science Excellence
0 votes
55 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 by (245 points) | 55 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
by (153 points)
0
can you explain? plzz
0
3should be highest because it's exponential function

2 logarithmic
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,291 answers
198,209 comments
104,889 users