title: Alternative to python's .sort() (for inserting into a large list and keeping it sorted)
body: <p>I need to continuously add numbers to a pre-sorted list:</p>
  
  <pre><code>for num in numberList:
      list.append(num)
      list.sort()
  </code></pre>
  
  <p>Each iteration is short but when the given numberList contains tens of thousands of values this method slows way down. Is there a more efficient function available that leaves a list intact and seeks out which index to insert a new number to preserve the correct order of numbers? Anything I've tried writing myself takes longer than .sort()</p>