The Gateway to Computer Science Excellence
0 votes
140 views
If $T1(n) = \Theta(f(n))$

&

$T2(n) = \Theta(f(n))$

Then, Is $T1(n) + T2(n) = O(f(n))$

If yes, then how?
in Algorithms by (5 points)
edited by | 140 views

1 Answer

+1 vote

Big-O is an upper bound.

Big-Theta is a tight bound, i.e. upper and lower bound.

so you can say Ɵ implies O, 

Therefore:  T1(n)+T2(n) = Ɵ(f(n)) = O(f(n))

for a good read: 

https://stackoverflow.com/questions/3230122/big-oh-vs-big-theta

by Active (2.1k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,644 questions
56,505 answers
195,555 comments
101,047 users