First clear solution for Median by jacekgrycza - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

First solution in Clear category for Median by jacekgrycza

def max(x):
    max=x[0]
    for i in x:
        if i>max:
            max=i
    return max
def min(x):
    min=x[0]
    for i in x:
        if i2):
        x.remove(max(x))
        x.remove(min(x))
    if len(x)==1:
        return (x[0])
    elif len(x)==2:
        return (x[0]/2+x[1]/2)

Oct. 26, 2016

Comments:

DerryK on Dec. 15, 2016, 12:42 a.m.
<p>A clever, but kind of slow, solution. The iterative max and min operations make this an approximately n**2 algorithm. Faster to sort the array and select data of interest out of the middle.</p>

List but not the least

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.