Master Theorem-Relation of the two functions

  • Context: MHB 
  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Functions Master
Click For Summary
SUMMARY

The discussion focuses on solving the recurrence relation T(n) = 4T(n/3) + n log n using the Master Theorem. The parameters identified are a = 4, b = 3, and f(n) = n log n. The analysis reveals that n^log_b(a) = n^log_3(4) is polynomially larger than n log n, confirming that a polynomial function dominates logarithmic functions for sufficiently large n. This conclusion is supported by L'Hôpital's rule, demonstrating that log n grows slower than any polynomial n^ε as n approaches infinity.

PREREQUISITES
  • Understanding of recurrence relations
  • Familiarity with the Master Theorem
  • Knowledge of logarithmic and polynomial growth rates
  • Basic proficiency in calculus, particularly L'Hôpital's rule
NEXT STEPS
  • Study the Master Theorem in-depth, focusing on its applications to different forms of recurrence relations
  • Explore advanced topics in asymptotic analysis, including Big O, Big Theta, and Big Omega notations
  • Learn about other methods for solving recurrence relations, such as the substitution method and the recursion tree method
  • Investigate the implications of polynomial versus logarithmic growth in algorithm analysis
USEFUL FOR

Students and professionals in computer science, particularly those studying algorithms and data structures, as well as anyone interested in analyzing the efficiency of recursive algorithms.

evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

I want to solve the recurrence relation

$$T(n)=4T{\left( \frac{n}{3} \right)}+n \log{n}.$$

I thought to use the Master Theorem.

We have $a=4, b=3, f(n)=n \log{n}$.

$\log_b{a}=\log_3{4}$

$n^{\log_b{a}}=n^{\log_3{4}}$

How can we find a relation between $n^{\log_{3}{4}}$ and $n \log{n}$ ? (Thinking)
 
Physics news on Phys.org
Hey evinda!

A polynomial dominates the logarithm doesn't it? 🤔
More specifically, for any $\varepsilon>0$ we have that $\ln n < n^\varepsilon$ for sufficiently large $n$.
Proof by L'Hôpital's rule:
$$\lim_{n\to\infty} \frac{\ln n}{n^\varepsilon} = \lim_{n\to\infty} \frac{\frac 1n}{\varepsilon n^{\varepsilon-1}} = \lim_{n\to\infty} \frac{1}{\varepsilon n^\varepsilon} = 0$$
🤔
 
Klaas van Aarsen said:
Hey evinda!

A polynomial dominates the logarithm doesn't it? 🤔
More specifically, for any $\varepsilon>0$ we have that $\ln n < n^\varepsilon$ for sufficiently large $n$.
Proof by L'Hôpital's rule:
$$\lim_{n\to\infty} \frac{\ln n}{n^\varepsilon} = \lim_{n\to\infty} \frac{\frac 1n}{\varepsilon n^{\varepsilon-1}} = \lim_{n\to\infty} \frac{1}{\varepsilon n^\varepsilon} = 0$$
🤔

I see... Thanks a lot! (Blush)
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
Replies
1
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K