title: What is the running Time complexity of this algorithm that getting all submultiples of n?
body: <pre><code>def get_submultiples(n):
      # Get all submultiples of n
      if n == 1:
          return [1]
      i = 2
      submultiples = set([1,n])
      m = n
      while i &lt; m:
          if n % i != 0:
              m = int(n/i)+1
          else:
              submultiples.add(i)
              submultiples.add(int(n/i))
          i += 1
      return submultiples
  </code></pre>
  <ol>
  <li>this algorithm wrote by myself, I want to know what is its O(?). Can anybody help me?</li>
  <li>it wrote by python and &quot;n&quot; is an integer.</li>
  </ol>