Register

T1(N)=OF(N),T2(N)=OF(N) THEN T1(N)+T2(N)=OF(N) is it true explain

2,923 views

1 Answer

Best answer
3 votes
3 votes

Yes this is true . 

say O (F(n)) = O(n2) (assume )

 T1(n) = O (n2)            and  T2(n) = O (n2)

then  T1(n) +  T1(n) = 2 O (n2)  = O (n2)  (constant term dont affect the complexity )

eg :

F(n) = 2n2 +n+1 then  

O (F(n))= n2  

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

525
views
1 answers
0 votes
abhinowKatore asked Jan 18, 2023
525 views
Will not Exist(cc in T1 is not equal to T2) gives TRUE ? , can anyone explain this
User Avatar
6.2k
views
0 answers
0 votes
Sanjay Sharma asked Apr 25, 2018
6,224 views
Suppose T1(N) = O (f (N)) and T2(N) = O (f (N)). Which of the following statements are true in gen
Q Suppose T1(N) = O (f (N)) and T2(N) = O (f (N)).Which of the following statements are true in general? (a) T1(N) + T2(N) = O (f (n)) (b) T1(N) − T2(N) = o (f (n)) (c) T1(N) / T2(N) = O(1) (d) T1(N) = O (T2 (N))
User Avatar
504
views
1 answers
2 votes
prady4 asked Jan 14, 2015
504 views
If lower bound and upper bound of a recurrence relation are not asymptotically equal, then is it possible for it to have a theta notation?
Is theta notation possible for all recurrence relation?
User Avatar
854
views
2 answers
0 votes
supraja asked Apr 18, 2015
854 views
f(n)=n+ logn is O(n) and Ω(n) can any one explain me please
User Avatar
Link Copied!