Incorrect code from the quiz

quicksort.py

def quickSort(arr):
    l = 0
    r = len(arr) - 1
    if l < r:
        i = l
        j = r + 1
        v = arr[l]
        while i < j:
            i += 1
            while i < r and arr[i] < v:
                i += 1
            j -= 1
            while j > l and arr[j] > v:
                j -= 1
            temp = arr[i]
            arr[i] = arr[j]
            arr[j] = temp
        temp = arr[i]
        arr[i] = arr[j]
        arr[j] = temp
        temp = arr[j]
        arr[j] = arr[l]
        arr[l] = temp
        quickSort(arr[l : j])
        quickSort(arr[j : r])