title: Finding the floor of square root without using sqrt function
body: <p>Let's say I have an integer <code>n</code> and I want to find the largest number <code>m</code> for which the square of that number is smaller than <code>n</code>.</p>
  
  <p>What would be the optimal solution for this problem? </p>