Re: Algebra of order notation need help
- From: "couper" <anilyalcinkaya@xxxxxxxxx>
- Date: 10 Oct 2006 11:49:25 -0700
Yan Tang yazdi:
if you want to prove the first two, you only need to prove the second
one.
you can prove it by \Theta definition.
I guess this is your algorithm homework, ;-).
couper wrote:
Hi,
I need the proof of those;
O(f(n)+g(n))=O(max{f(n),g(n)})
theta(f(n)+g(n))=theta(max{f(n),g(n)})
omega(f(n)+g(n))=omega(max{f(n),g(n)})
yes it is :)
.
- References:
- Algebra of order notation need help
- From: couper
- Re: Algebra of order notation need help
- From: Yan Tang
- Algebra of order notation need help
- Prev by Date: Re: hash function to produce 4 byte number out of 16 byte number
- Next by Date: Re: Windows App with semi-transparent UI as an "overlay" - possible?
- Previous by thread: Re: Algebra of order notation need help
- Next by thread: Application interaction - Conceptual dilemma
- Index(es):