The Full Counting Sort

  • + 0 comments

    Python solution:

    def countSort(arr):
        mid_point = len(arr)//2
        mid_point_arr = [[elem[0], "-"] for elem in arr[:mid_point]]
        dashed_arr = mid_point_arr + arr[mid_point:]
        dashed_arr.sort(key=lambda elem: int(elem[0]))
        [print(elem[1], end=" ") for elem in dashed_arr]