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

Sort by

recency

|

720 Discussions

|

  • phanvantienpvt01
     + 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)))

  • yashdeora98294
     + 0 comments

    Here is problem solution in python java c++ c and javascript - https://programmingoneonone.com/hackerrank-the-full-couting-sort-problem-solution.html

  • shiaramoon
     + 0 comments

    python solution

    def countSort(arr):
    n = len(arr)
    sort = [ [ ] for _ in range(n)]
    for i, pair in enumerate(arr):
        if i < n// 2:
            pair[1] = "-"
        sort[int(pair[0])].append(pair[1])
    
    print(" ".join([char for line in sort for char in line]))

  • muktadeer
     + 0 comments

    public static void countSort(List> arr) { // Write your code here int cnt = arr.size(); int hc = cnt / 2;

        List<List<String>> sc = new ArrayList<>(cnt);

    for (int i = 0; i < cnt; i++) {
        sc.add(new ArrayList<>());
    }

    int i = 0;
    for (int j = 0; j < cnt; j++){
        int key = Integer.parseInt(arr.get(j).get(0));
        String vlu = arr.get(j).get(1);

        if(i<hc){
            vlu = "-";
        }
        sc.get(key).add(vlu);
        i++;
    };

    sc.forEach((t) -> {
        if(!t.isEmpty()){
          System.out.print(String.join(" ", t)+ " ");
        }
    });
}

  • piotr_komisarcz1
     + 0 comments

    I've been struggling a lot to get the Test number 5 to run within time limits. Here is my approach in C# - hope it helps someone.

        public static void countSort(List<List<string>> arr){
        var buckets = new List<string>[100];
        for(int i=0; i<100; i++){
            buckets[i] = new List<string>();
        }
        
        var count = arr.Count();
        var half = count / 2;
        
        for(int i=0; i<count; i++){
            var index = int.Parse(arr[i][0]);
            var value = arr[i][1];
            if(i<half){
                value = "-";    
            }
            buckets[index].Add(value);
        }
              
        for(int i=0; i<100; i++){
            var size = buckets[i].Count();
            if (size > 0){
                Console.Write(string.Join(" ", buckets[i]) + " ");
            }
        }
    }