title: calculating time complexity of a algorithm
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/487258/plain-english-explanation-of-big-o">Plain English explanation of Big O</a>  </p>
  </blockquote>
  
  
  
  <p>I have been doing programing for 4 years  now, but i never paid attentions to what time complexity is closely. i have a interview tomorrow and i  know they will be asking me questions on it.Can anyone help me understand time complexity in simple terms with example?By looking at the code how can we decide if its complexity is O(n) or O(log n) O(n) etc?</p>