retagged by
246 views

1 Answer

0 votes
0 votes

Given,

f(n)=n

g(n)=n(1+sin n)

the value of sin n will be between -1 and 1 so g(n) will be between n(1-1)=1 and n1+1=n2, depending on the value of n

So one cant bound the other for large value of n,

Hence answer is  D

black line is f(n) and blue curve is g(n)

Heres the link for the graph: http://fooplot.com/#W3sidHlwZSI6MCwiZXEiOiJ4IiwiY29sb3IiOiIjMDAwMDAwIn0seyJ0eXBlIjowLCJlcSI6InheKDErc2luKHgpKSIsImNvbG9yIjoiIzVEMThCRCJ9LHsidHlwZSI6MTAwMCwid2luZG93IjpbIi0xNjIuNDk5OTk5OTk5OTk5NzIiLCIxNjIuNDk5OTk5OTk5OTk5NzIiLCItOTkuOTk5OTk5OTk5OTk5ODIiLCI5OS45OTk5OTk5OTk5OTk4MiJdfV0-

Answer:

Related questions

377
views
1 answers
0 votes
I_am_winner asked Sep 6, 2018
377 views
f(n)>=c1.nh(n)=c2.nthen why answer cant be O(n),It is given as C
3.1k
views
2 answers
3 votes
Rishav Kumar Singh asked Jul 25, 2018
3,074 views
What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2.void fun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j...
956
views
1 answers
2 votes
gauravkc asked Apr 5, 2018
956 views
What is the time complexity of this code?
415
views
1 answers
2 votes
92komal asked Jan 26, 2018
415 views
plz help me . how to solve that type of question