Quicksort implementation in Python

quicksort.py

data = [1, 5, 2, 5, 3, 5, 5]


def quicksort(left, right):
    if 0 > left:
        raise ValueError("left border must be greater or equal zero")
    if right >= len(data):
        raise ValueError("right index cant be greater than length")

    if left < right:
        divider = divide(left, right)
        quicksort(left, divider - 1)
        quicksort(divider + 1, right)


def swap(i, j):
    temp = data[i]
    data[i] = data[j]
    data[j] = temp


def divide(left, right) -> int:
    i = left
    j = right - 1
    pivot = data[right]

    while i < j:
        # find an element bigger than the pivot element, starting left
        while data[i] < pivot and i < right - 1:
            i = i + 1

        # find an element which is smaller the the pivot element, this time starting from right
        while data[j] >= pivot and j > left:
            j = j - 1

        if i < j:
            swap(i, j)

    if data[i] > pivot:
        # right not left
        swap(i, right)

    return i


quicksort(0, len(data) - 1)