title: Return well-formed numbers
body: <p>I found this in an interview questions forum:</p>
  
  <blockquote>
    <p>Write a function to return well formed
    numbers of size n. A well formed
    number is one in which digit i is less
    than digit i+1, for example 123, 246, 349 etc</p>
  </blockquote>
  
  <p>So here's how I would do it in Python:</p>
  
  <blockquote>
    <ul>
    <li>input number of digits (x)</li>
    <li>loop over all the numbers of x digits</li>
    <li>for each number n, if str(n) == "".join(sorted(str(n))), print number</li>
    </ul>
  </blockquote>
  
  <p>So my question is... Is this method efficient and pythonic? I'm sure there should be a more elegant way out there, so any tips would be great appreciated.</p>
  
  <p>Craig</p>