Ranks calculation

[robmio]

(10-31-2024 04:41 PM)Albert Chan Wrote:  

Code:

def ranking(m):
    hi = len(m)
    m2 = zip(m, range(hi))
    m2.sort()        # sort with index
    lo, m3 = 0, m[:] # work with a copy
    for i in range(hi):
        j = i+1
        if j != hi and m2[i][0]==m2[j][0]: continue    
        r = (lo+i)/2 # j-lo items have same ranking
        for k in range(lo,j): m3[m2[k][1]] = r+1
        lo = j
    return m3

p2> ranking([1,3,5,1,4,5,6,1])
[2.0, 4.0, 6.5, 2.0, 5.0, 6.5, 8.0, 2.0]

Thank you so much, Albert Chan. I really appreciate it! Kind regards, Roberto