title: What is the Big-O performance of this algorithm and how do I solve this normally?
body: <p>Hello I have an algorithm that I am having trouble with finding the performance. </p>
  
  <pre><code> i=math.ceil(n**0.5)
   while n % i != 0: 
    i -= 2
  </code></pre>
  
  <p>Would this be O(2^n)?</p>