873 views
0 0 votes

State true/false

f(n) != O(g(n)) and g(n) != O(f(n))

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 1 answer
3.9k
3.9k views
sushmita asked Sep 28, 2018
3,859 views
Arrange the following functions in their increasing order of complexities.$f(n) = n ^{0.999999} * \log n$ ($\log n$ is not in power)$g(n) = 10000 n$$h(n) = n^{2}...
0 0 votes
1 answers 1 answer
1.9k
1.9k views
sushmita asked Sep 28, 2018
1,927 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 1 vote
2 answers 2 answers
1.8k
1.8k views
sushmita asked Sep 28, 2018
1,808 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 0 votes
2 2 answers
1.9k
1.9k views
sushmita asked Sep 28, 2018
1,893 views
FIND THE TIME COMPLEXITYint i=1,j; for(;i <= n;i + +) { for(j = i; j <= nlogn; j∗= 2) { sum++; } }