Algorithm A performs 10n^2 basic operations and algorithm B performs 300 ln n basic operations. For what value of n does algorithm B start to show its better performance?
I need to know how to do this
Don't panic when you see a new problem. Take some time to read it carefully and think about it. Do you understand what the problem is asking? If not, identify precisely what is not clear. Do you understand what mathematical question you need to answer in order to solve the problem? If not, please explain why. If you understand the mathematical question, take some time to think how it can be solved. If you don't know, then again please describe your difficulty. For example, for a different problem you could say, "The problem reduces to solving this equation of degree 5. I know how to solve quadratic equations, but I have not encountered an algorithm for solving equations of degree 5."
My answer in post #2 was trivial and was intended to make you describe your difficulty in more detail in the pattern above. If that answer was not clear to you, then, well, again, please explain what you don't understand.