def find_values(l, k=1): min_value = l[0] max_value = l[0] c = [] for j in range(len(l)): if l[j] < l[min_value]: min_value = j if l[j] > l[max_value]: max_value = j for i in range(l[max_value]-l[min_value]+1): c.insert(i, 0) for i in range(len(l)): print l[i]-l[min_value] #c.insert(l[i]-l[min_value], 0) c[l[i]-l[min_value]] += 1 for i in range(len(c)): if c[i] == 0: continue while(c[i]): c[i] -=1 s.append(i+1) return s