calculate n for nlog(n) and n! when time is 1 second. (algorithm takes f(n) microseconds)
<p>given the following problem from CLRS algo book.</p>

<blockquote>
  <p>For each function f (n) and time t in the following table, determine
  the largest size n of a problem that can be solved in time t, assuming
  that the algorithm to solve the problem takes f(n) microseconds.</p>
</blockquote>

<ol>
<li>how can one calculate n for f(n)=nlog(n) when time is 1 second? </li>
<li>how can one calculate n for f(n)=n! when time is 1 second?</li>
</ol>