```
def quicksort(array):
    print(array)
    n = 0
    pivot = len(array) - 1
    while n < pivot:
        if array[pivot] > array[n]:
            n+=1
        elif array[pivot] <= array[n]:
            array[n],array[pivot-1] = array[pivot-1], array[n]
            array[pivot],array[pivot-1] = array[pivot-1], array[pivot]
            pivot -= 1
    if len(array[:pivot]) >1:
        array[:pivot] = quicksort(array[:pivot])
    if len(array[pivot+1:])> 1:
        array[pivot+1:] = quicksort(array[pivot+1:])
    return array

test = [21, 4, 1, 3, 9, 20, 25, 6, 21, 14]
print(quicksort(test))

```

raises the following error:

```
Error: Traceback (most recent call last):
  File "C:\Users\admin\AppData\Local\Programs\Python\Python37-32\idle.py", line 18, in <module>
    print(quicksort(test))
  File "C:\Users\admin\AppData\Local\Programs\Python\Python37-32\idle.py", line 14, in quicksort
    array[pivot:] = quicksort(array[pivot:])
  File "C:\Users\admin\AppData\Local\Programs\Python\Python37-32\idle.py", line 14, in quicksort
    array[pivot:] = quicksort(array[pivot:])
  File "C:\Users\admin\AppData\Local\Programs\Python\Python37-32\idle.py", line 12, in quicksort
    array[:pivot] = quicksort(array[:pivot])
  File "C:\Users\admin\AppData\Local\Programs\Python\Python37-32\idle.py", line 14, in quicksort
    array[pivot:] = quicksort(array[pivot:])
  File "C:\Users\admin\AppData\Local\Programs\Python\Python37-32\idle.py", line 14, in quicksort
    array[pivot:] = quicksort(array[pivot:])
  File "C:\Users\admin\AppData\Local\Programs\Python\Python37-32\idle.py", line 14, in quicksort
    array[pivot:] = quicksort(array[pivot:])
  [Previous line repeated 987 more times]
  File "C:\Users\admin\AppData\Local\Programs\Python\Python37-32\idle.py", line 3, in quicksort
    pivot = len(array) - 1
RecursionError: maximum recursion depth exceeded while calling a Python object

```