We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Sorting
  4. The Full Counting Sort
  5. Discussions

The Full Counting Sort

  • vuhuutuan0
     + 0 comments

    My answer in Typescript, noted

    function countSort(arr: string[][]): void {
    // create converted arr, fill with []
    let arr_converted = Array.from({ length: arr.length }, () => []);

    // forech element in [arr], add to [arr_converted]
    for (let i = 0; i < arr.length; i++) {
        let n = Number(arr[i][0])
        let c = i + 1 <= arr.length / 2 ? '-' : arr[i][1]

        arr_converted[n].push(c)
    }

    // print
    console.log(arr_converted.flat().join(' ').trim())
}