in Algorithms retagged by
758 views
0 votes
0 votes
in Algorithms retagged by
by
758 views

2 Answers

3 votes
3 votes
Yes. Both are true and hence we can also use theta notation. This basically means f(n) has the same order of growth (asymptotically) as n. So, for very large n, value of f(n) will be growing same like n (log n will become negligible).
by

3 Comments

sir can you please explain me why it is Ώ(n)
0
0

Ώ(n) basically means the growth rate (asymptotic) of given function is higher than that of n. Since n is a term in the given function, this is straight forward. 

n, 2n, n2, nlogn all are Ώ(n).

It is like saying ≥. Ώ is for ≥, O is for ≤ and when both holds it becomes ϴ or =. All comparisons being done with asymptotic growth and not just value comparison. 

2
2
thanku sir now I got it
1
1
0 votes
0 votes
The sum of two functions is governed by the dominant one....

O(f(n)) +O(g(n)) → O(max(f(n),g(n))) , similarly

Ω(f(n)) + Ω(g(n))  → Ω(max(f(n),g(n)))