title: Complexity of LCM
body: <p>What is the complexity of code to find LCM. This complexity will never be O(n). Also the steps would vary according to input. Thanks. </p>
  
  <pre><code>public static int findGCD (int a, int b) {
      int c;
      do {
          c = a % b;
          if (c &gt; 0) {
              a = b;
              b = c;
          }
      } while (c != 0);
      return b;
  }
  </code></pre>