#divide and conquer
def min(a):
    n = len(a)
    if n==1:
        return a[0]
    if n==2:
        if a[0] < a[1]:
            return a[0]
        return a[1]
    n = int(n / 2)
    return min([min(a[:n]),min(a[n:])])

#incremental
def min(a, z):
    if a[0] < z:
        z = a[0]

    if len(a)== 1:
        return z
    return min(a[1:],z)

#equivalent, without the function overhead
def min(a):
    z = a[0]
    for i in a:
        if i < z:
            z = i
    return z

print min([1,6,43,7,3,4,-6,8,45,3,7,5,34,6,8,89,3,2,7,2,7,4,8,89,5,-1])