Register

Doubt

1,957 views
1 votes
1 votes
n/100= Ω(n)

Is this True or False explain
User Avatar

2 Answers

1 votes
1 votes
Answer is true.

Take c = 0.0001.

So there exists c for which this relation is true.
User Avatar
0 votes
0 votes
This is asymptotically true only but not mathematically.

because n/100 is any way smaller than n.

if we say n/100=O(n) and n/100=theta(n)   then it will be both asymptotically as well as mathematically true
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
3 answers
2
Nisha Bharti asked Sep 26, 2022
737 views
Self doubt.
What is the time & space complexity of this algorithm? Main() { for(i=n; i>10; i=i^1/4) { for(j=201; j<n^3; j=j+400) { for(k=47; k<=n^84; k=k*108) { k=k^61; } } } }
What is the time & space complexity of this algorithm?Main(){ for(i=n; i>10; i=i^1/4) { for(j=201; j<n^3; j=j+400) ...
User Avatar
0 votes
0 votes
1 answer
3
tusharb asked Feb 18, 2022
710 views
Algorithm self doubt
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to reduce the time complexity to O(n)?
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to...
User Avatar
2 votes
2 votes
1 answer
4
samarpita asked Dec 29, 2021
643 views
#self doubt
how to solve this?
how to solve this?
User Avatar
Link Copied!