title: Big O, how do you calculate/approximate it?
body: <p>Most people with a degree in CS will certainly know what <a href="http://www.nist.gov/dads/HTML/bigOnotation.html" rel="noreferrer">Big O stands for</a>.
  It helps us to measure how well an algorithm scales. </p>
  
  <p>But I'm curious, how do <em>you</em> calculate or approximate the complexity of your algorithms?</p>