def quickSort(arr, low, high):
    if (len(arr) == 1):
        return arr
    if (low < high):
        pi = partition(arr, low, high)
        quickSort(arr, low, (pi - 1))
        quickSort(arr, (pi + 1), high)
def quickSort(arr, low, high):
    if (len(arr) == 1):
        return arr
    if (low < high):
        pi = partition(arr, low, high)
        quickSort(arr, low, (pi - 1))
        quickSort(arr, (pi + 1), high)