title: fastest method of getting k smallest numbers in unsorted list of size N in python?
body: <p>What is the fastest method to get the k smallest numbers in an unsorted list of size N using python?<br>
  Is it faster to sort the big list of numbers, and then get the k smallest numbers,<br>or to get the k smallest numbers by finding the minimum in the list k times, making sure u remove the found minimum from the search before the next search?</p>