Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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.)
log4(3) is less than 1, and so n^(log4(3)) is less than n^1 = n, which is less than n*log2(n).