title: Algorithm (Python): find the smallest number greater than k
body: <p>I have a question from algorithm point of view.
  I have a list of numbers (floats)</p>
  
  <pre><code>1.22,3.2, 4.9,12.3.....and so on
  </code></pre>
  
  <p>And I want to find the smallest number greater than (lets say) 4..
  So the answer is 4.9
  But besides the obvious solution.. (iterating thru list and keeping a track of smallest number greater than k) what is the "pythonic way" to do this.
  Thanks</p>