title: Recursive function that takes in a list and an integer and returns the integer in the list in order
body: <p>So let's say I this function:</p>
  
  <pre><code>squeeze([1,4,7,9], 8)
  squeeze([1,4,7,9], 0)
  </code></pre>
  
  <p>I would want the function to return a new list containing:</p>
  
  <pre><code>[1,4,7,8,9]
  [0,1,4,7,9]
  </code></pre>
  
  <p>I want to make this function using recursion, but I'm having trouble</p>
  
  <pre><code>def squeeze(x:list, num:int):
      if len(x) == 1:
          if num &lt; x[0]:
              return [num] + x #if the integer is less than the 1st value, put it in the front
          elif x[0] &lt; num &lt; x[2]: 
              return [x[0]] + [num] + [x[2]] #put it in the list
           #insert this number into the correct spot
      else: 
          return squeeze(num, x[0:1]) + squeeze(num, x[1:]) #i don't think this is right
  </code></pre>
  
  <p>I'm having trouble comparing the numbers in the list and putting it in the correct spot by using recursion.</p>