Divide and conquer approach to finding index of largest element in a list.

gistfile1.py

# Yay school. 
def find_largest(mylist):
    if len(mylist) == 1:
        return 0
    elif len(mylist) == 2:
        if mylist[0] > mylist[1]:
            return 0
        else:
            return 1
    else:
        m = len(mylist) / 2
        blist = mylist[0:m]
        clist = mylist[m:len(mylist)]
        largest_b = find_largest(blist)
        largest_c = find_largest(clist) + m
        if mylist[largest_b] > mylist[largest_c]:
            return largest_b
        else:
            return largest_c

mylist = [100,15,85,20,25]
largest = find_largest(mylist)
print("Largest: %d. Largest element: %d" % (largest, mylist[largest]))