title: Ordering a list of complexities (Big O)
body: <p>Given a list of complexities: </p>
  
  <p><img src="https://i.imgur.com/H1Ycr.png" alt=""></p>
  
  <p>How do you order then in their Big O order? </p>
  
  <p>I think the answer is below? </p>
  
  <p><img src="https://i.imgur.com/ANHFo.png" alt=""></p>
  
  <p>Question now is how does <code>log(n!)</code> become <code>n log(n)</code>. Also I don't know if I got the n! and (n-1)! right. Is it possible that c^n can be bigger than n!? When c > n?</p>
  
  <p>In general how do I visualize such Big O problem ... it took me quite long to do this ... compared to coding so far ... Any resources, videos MIT Open Courseware resources, something with explaination</p>