Python code example for 'square root' time complexity : <p>I'm learning about the different Big O time complexities, and the last one I have is the 'square root', but I just can't seem to find any useful Python code snippets that uses a <em>simple</em> algorithm for demonstrating this time complexity.</p>

<p>I find it easier to understand these complexities when I can see a simple (even if unrealistic) code snippet.</p>
