How about:

def median(lst):
        lst = sorted(lst)
        inner = lst[(len(lst) - 1) // 2 : (len(lst) + 2) // 2]
        if len(inner) > 1:
                return sum(inner) / 2.
        else:
                return inner[0]


--Scott David Daniels [EMAIL PROTECTED] -- http://mail.python.org/mailman/listinfo/python-list

Reply via email to