383 views
1 votes
1 votes
f(n) = O(g(n)) and g(n) = O(f(n)),then f(n) = g(n) ---> True or False

The answer to this question is False and this the explanation given by them  " False: f(n) = n and g(n) = n+1".

Someone please explain what are they trying to say.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
sushmita asked Sep 28, 2018
931 views
Find the complexity of the following code fragment:int i = 1; for(; i <= n logn; i++) { for(i++; i <= n; i++) { printf("1") } }
1 votes
1 votes
2 answers
2
sushmita asked Sep 28, 2018
799 views
Find the complexity of the following function when called with some integer n:void foo(n) { int i,j,k,x=0; for (i=1 ; i <= n ; i++) for (j=1 ; j <= i * i ; j++) for ( k ...
0 votes
0 votes
2 answers
3
sushmita asked Sep 28, 2018
856 views
FIND THE TIME COMPLEXITYint i=1,j; for(;i <= n;i + +) { for(j = i; j <= nlogn; j∗= 2) { sum++; } }
0 votes
0 votes
0 answers
4
sushmita asked Sep 28, 2018
358 views
State true/falsef(n) != O(g(n)) and g(n) != O(f(n))