The Full Counting Sort

  • + 0 comments

    My python sollution

    def countSort(a):
        m_value = 0
        for i in range(len(a)):
            if i < len(a) // 2 :
                a[i][1] = '-'
            a[i][0] = int(a[i][0])
            m_value = max(m_value,a[i][0])
        sort = [[] for i in range(m_value+1)]
        for j in range(len(a)):
            sort[a[j][0]].append(a[j][1])
        result = []
        for i in sort :
            result.extend(i)
        print(' '.join(map(str,result)))