quick sort of Hoare partition

example.py

def quickSort(arr):
    def partition(arr, left, right):
        pivot = arr[left]
        i = left - 1
        j = right + 1
        while True:
            while i < right:
                i += 1
                if arr[i] >= pivot:
                    break
            while left < j:
                j -= 1
                if pivot >= arr[j]:
                    break
            if i >= j:
                return j
            arr[i], arr[j] = arr[j], arr[i]

    def quickSort(arr, left, right):
        if left < right:
            p = partition(arr, left, right)
            quickSort(arr, left, p)
            quickSort(arr, p + 1, right)

    quickSort(arr, 0, len(arr) - 1)


if __name__ == '__main__':
    arr = [3,7,8,5,1,2,11,5,4]
    quickSort(arr)
    print(arr)