The Full Counting Sort

  • [deleted]
    + 0 comments

    Python solution with enumerate():

    def countSort(arr):
        final_list = [[] for k in range(len(arr))]
    
        for count,value in enumerate(arr):
            if count < len(arr)//2:
                final_list[int(value[0])].append('-')
            else:
                final_list[int(value[0])].append(value[1])
        
        print(' '.join([j for k in final_list for j in k]))