Math Is Fun Forum
  Discussion about math, puzzles, games and fun.   Useful symbols: √ ∞ ≠ ≤ ≥ ≈ ⇒ ∈ Δ θ ∴ ∑ ∫ π -

Login

Username

Password

Not registered yet?

Post a reply

Go back

Write your message and submit
:) :| :( :D :o ;) :/ :P :lol: :mad: :rolleyes: :cool: | :dizzy :eek :kiss :roflol :rolleyes :shame :down :up :touched :sleep :wave :swear :tongue :what :faint :dunno
Options

Go back

Topic review (newest first)

anonimnystefy
2013-01-10 23:40:01

I do. It means that the function T(n) grows the same way as the function isnide the theta...

I think somethong is wrong either with tthe logarithms or with the conditions for p in the second case (a=b^k)...

bob bundy
2013-01-10 19:33:40

I think it is



What I don't follow is the theta function notation.  Do you recognise that?

Bob

anonimnystefy
2013-01-10 01:56:38

What do you mean by log^p?

azair
2013-01-09 22:09:06

Hello everyone wave, I am learning an Algorithm analysis on my own and today I came across 'Master Theorem for Divide and Conquer'. Since I'm quite not good at Mathematics, this topic is giving me a full headache.(ahem ahem, no offense please!!! ;-)).
Alright, The definition is given as follows :

"If the recurrence is of the form T(n)=aT(n/b)+Θ(n^k log^p n),where a>=1, b>1, k>=0 and p is a real number, then:
1.)  If a>b^k, then T(n)=Θ(n^log^a↓b)   [Note : lets assume ↓ as base.]

2.)  If a=b^k :
               a.) If p>-1, then T(n)=Θ(n^log^a↓b * log^p+1 n)
               b.) If p=-1, then T(n)=Θ(n^log^a↓b * loglog n)
               c.) If p<-1, then T(n)=Θ(n^log^a↓b).

3.) If a<b^k :
               a.) If p>=0, then T(n)=Θ(n^k log^p n)
               b.) If p<0, then T(n)=O(n^k).

"
Well can anyone help me explain what these means in simple terms with an example if possible.
For example : Problem--> T(n)=2T(n/2)+nlogn. [The Answer is Θ(nlog logn) :? How???dizzy]

{I'm assuming this tutorial's topic as : MASTER THEOREM FOR DUMMIES. big_smile}
Thanking you in advance...

Board footer

Powered by FluxBB