下列程序是分治算法的典型应用，其运行结果是？（ ）

def dividAndConquer(arr, left, right):
    if (right == left + 1) or (right == left):
        return max(arr[left], arr[right])
    mid = int((left + right) / 2)
    leftMax = dividAndConquer(arr, left, mid)
    rightMax = dividAndConquer(arr, mid, right)
    return max(leftMax, rightMax)


arr1 = [8, 1, 14, 19, 5]
print(dividAndConquer(arr1, 0, 4))