Back of the envelope sorts using dictionary keys or sorts of values

sorts.py

def num(m):
    h={}
    for i in m:
        j=i.split(",")
        if (j[0] in h):
           h[j[0]]=h[j[0]]+1
        else:
           h[j[0]]=1
    return h


# sortAndWrite(n)
def sortAndWrite(n):
    sort=sorted(n, key=lambda key: n[key])
    f=open('sorted.value','w')
    for i in sort:
        f.write(str(i)+","+str(n[i])+"\n")
    f.close()
    f=open('sorted.key','w')
    for i in sorted(n.iterkeys()):
        f.write(str(i)+","+str(n[i])+"\n")
    f.close()