Take the 2-minute tour ×
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It's 100% free, no registration required.

While studying master method at recurrences topic I'm stacked at a point. It is written in the book as:

$T(n) = 3T(n/4) + n \log n$,

we have $a = 3, b = 4$,

$f(n) = n \log n$, and

$n^{\log_b(a)} = n^{\log_4 3} = O(n^{0.793})$.

Since $f(n) = \Omega(n^{\log_4( 3)+\varepsilon} )$, where $\varepsilon \approx0.2$ ....

The authors means that the $n\log n = \Omega(n)$. How will we know this? Is $n \log n = \Omega(n)$ true? Or something is wrong?

share|improve this question

migrated from stackoverflow.com Nov 8 '12 at 18:53

This question came from our site for professional and enthusiast programmers.

See related question –  Nicholas Mancuso Nov 8 '12 at 20:51
It's better to say $n\log n \in \Omega(n)$ instead of $n\log n = \Omega(n)$, I think if you think so, you will have a less problem on understanding this. –  user742 Nov 9 '12 at 9:41
See also this question. –  Raphael Nov 12 '12 at 11:19

1 Answer 1

Yes, $ n\log n = \Omega(n) $ is true.

To see why, note that for this to be true, we have to show that $ n\log n \ge cn$ for all $n \gt n_0 $ and $ \exists c \gt 1 $. If we take $ c = 1 $ then, we get $n\log n \ge n$ for all $n \ge 2$. This shows that $ n\log n = \Omega(n) $ is true.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.