Polynomially larger - confusion

Question

I am studying for my algorithms class. I have a question in context to the Masters theorem:

How is n.log2(n) polynomially larger than n^(log4(3))

(log2(x) = log to the base 2 of x
log4(x) = log to the base 4 of x) (Note: This is a solved problem on page.95 of 'Introduction to Algorithms' by Cormen et.al.)

score 2 · Accepted Answer · answered May 09 '11 at 01:41

2

log4(3) is less than 1, and so n^(log4(3)) is less than n^1 = n, which is less than n*log2(n).

answered May 09 '11 at 01:41

jwodder

54,758
12
108
124

Thanks for the simple explanation! – rgamber May 09 '11 at 01:59

Polynomially larger - confusion

1 Answers1