""" class exercise : use recursion to find biggest in list """

def biggest(numbers):
    if len(numbers) == 0:
        return None
    if len(numbers) == 1:
        return numbers[0]
    first = numbers[0]
    rest = numbers[1:]
    biggest_rest = biggest(rest)
    if first > biggest_rest:
        return first
    else:
        return biggest_rest

def test_biggest(numbers):
    big = biggest(numbers)
    print "biggest in %s is %s" % \
        (str(numbers), str(big))

test_biggest([])
test_biggest([5])
test_biggest([10, 5, 3])
test_biggest([3, 10, 1])