title: who grows faster? nlgn or lgn! ? and how to get T(n)
body: <p>I got a algorithm
  n is array's length.
  and binary_search(array, 0, n, value) 's T(n) is T(n) = Theta(lgn).</p>
  
  <pre><code>CHECK_VALUE_IN_ARRAY(array, n, value)
  for i = 1 to n
      binary_search(array, i, n, value)
  </code></pre>
  
  <p>how to get T(n) ?
  Here is my steps:</p>
  
  <pre><code>T(n) = c(lg(1) + lg(2) + lg(3) + ...+ lg(n)) 
      = clgn!
      = Theta(lgn!)
  </code></pre>
  
  <p>Is this right?</p>
  
  <p>2) If this is right?
     Who grows faster?
     nlgn vs lgn!</p>
  
  <p>Thank you very much</p>