title: Recursion results in nested lists
body: <p>Running my function <code>frisbeeSort()</code> always results in the list being sorted but with each item being in a nested list. I would like to recursively alter the original list instead of using a temp list.</p>
  
  <pre><code>def frisbeeSort(n):
      index = n.index(min(n))
      if len(n) == 1:
          return n[0]
      else:
          n[0:index + 1] = n[index::-1]
          n = [n[0], frisbeeSort(n[1:])]
      return n
  
  list1 = [12, 42, 34, 12, 76, 45, 13, 98, 234, 1]
  </code></pre>
  
  <p>I expect </p>
  
  <pre><code>[1, 12, 12, 13, 34, 42, 45, 76, 98, 234]
  </code></pre>
  
  <p>but I keep getting</p>
  
  <pre><code>[1, [12, [12, [13, [34, [42, [45, [76, [98, 234]]]]]]]]]
  </code></pre>