How do you calculate the value of N for similar efficiency in running time algorithms?
<p>I'm attempting to understand the calculations of running times, however, I've reached an impasse. If you have two functions, say </p>

<pre><code>    (N^3 + 2N^2 + 6N + 3)
</code></pre>

<p>and</p>

<pre><code>    (6N^2 + 4N + 10)
</code></pre>

<p>How do you approach finding the value of N at which the two algorithms reach the same efficiency? I would prefer to not be given the actual value, but how to approach the problem. I plugged in 0, 1, 4, 10, and 67 (the choices given) for N^3 and 6N^2, but in every case N^3 was always smaller (except for 0 of course). Am I doing this incorrectly? </p>