math - Big O Log problem solving -


I have a question that reads from an algorithm book that I am reading and how I am stumped on how to solve it (This has been a long time since I have logged in or exponent math). The problem is as follows:

Assume that we are comparing the implementation of the entry sort and sorting on the same machine. For the input of size N, the merge sort runs in 8n ^ 2 steps, while the merge sort runs in 64n log n phase. What is the entry type sort merge merge for the N key?

The basis of the log is 2. I have started trying to solve for equality, but n = 8 are stuck around log n.

I have to answer to discuss how to solve a mathematical way.

Thank you in advance!

(old link has stopped working)

< / Html>

Comments

Popular posts from this blog

c# - sqlDecimal to decimal clr stored procedure Unable to cast object of type 'System.Data.SqlTypes.SqlDecimal' to type 'System.IConvertible' -

Calling GetGUIThreadInfo from Outlook VBA -

Obfuscating Python code? -