Solving Algorithm Equations

[116Rohan]

I have been trying to figure out how to solve uneqaulity problems
I have two equations which I am trying to figure out

What values of n will make
8n^2 < 64 * n * Lg n
What I am trying to find is, is there a way to solve these kinds of
problems?

and also i am trying to figure out the below problem

What is the smallest value of n such that an algorithm whose running
time is 100n^2 runs faster than algorithm whose running time is 2n^2 on
the same machine.

Any pointers will help

Rohan

[Nucc]

Try Fixpoint Iteration from numerical analyzis (or other iterations).

by google an example:
http://www.bodysoulmath.org/sessions...session-d2.pdf

Now i haven't got any time, later I'll write more

[asdf]

try dividing both sides by n..

[Default User]

asdf wrote:

try dividing both sides by n..

Both sides of what? See below or read this fine web page:

<http://cfaj.freeshell.org/google/>

Brian

--
Please quote enough of the previous message for context. To do so from
Google, click "show options" and use the Reply shown in the expanded
header.

[asdf]

both sides of the equation 8n^2 < 64 * n * Lg n

[Ben Pope]

asdf wrote:

both sides of the equation 8n^2 < 64 * n * Lg n

What about both sides of that equation?

See below or read this fine web page:

<http://cfaj.freeshell.org/google/>

Ben Pope
--
I'm not just a number. To many, I'm known as a string...

[asdf]

what equation ?

[Ben Pope]

asdf wrote:

what equation ?

swoosh.

Ben Pope
--
I'm not just a number. To many, I'm known as a string...