title: What would be the time complexity of following Algorithm
body: <p>The steps of algorithm are:</p>
  
  <ol>
  <li>Set J = N</li>
  <li>Repeat while J >1
     Module A.
     J = J/2</li>
  <li>Return.</li>
  </ol>
  
  <p>I need to find the time complexity of following in Big O notation.</p>