title: Finding/Calculating complexity of a method
body: <blockquote>
    <p><strong>Possible Duplicate:</strong><br>
    <a href="https://stackoverflow.com/questions/3255/big-o-how-do-you-calculate-approximate-it">Big O, how do you calculate/approximate it?</a><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 just saw this question: <a href="https://stackoverflow.com/questions/9076650/find-nearest-number-in-unordered-array">Find nearest number in unordered array</a>. In answers peoples are talking about complexity of approach they are proposing. How do they calculate it? What does O(n) or O(logn) means? How to find/Calculate complexity of a method/program?</p>