title: What would be the time complexity and Big-0 of this pseudo code?
body: <p>Algorithm <code>squareRoot (k)</code></p>
  
  <p>Approximates the square root of k using the "Babylonian Method". </p>
  
  <pre><code>pre: k is an integer
  
  returns: approximation of square root of k 
  1:    guess ← 1.0                                   // ??
  
  2:    for i from 0 to i&lt;=100 do                     //??
  
  3:       guess ← (guess + k/guess) / 2.0             //??
  
  4:    done                                          // This has no running time of course
  
  f(n)= ?
  O(?) 
  </code></pre>