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. Counting Sort 1
  5. Discussions

Counting Sort 1

Sort 440 Discussions, By:

  • fran_mahon
     + 0 comments

    Python 3

    def countingSort(arr):
    index_sort = [0] * 100

    for i in arr:
        index_sort[i] += 1

    return index_sort

  • a_kay3
     + 0 comments

    python solution

        length = len(arr)
    result = [0] * length
    for i in arr:
        result[i] = result[i] + 1
    return result[:100]

  • bosymm
     + 0 comments

    JAVA

        // Write your code here
    List<Integer> res = new ArrayList<>();
    for(int i=0; i<100; i++) {
        res.add(i, Collections.frequency(arr, i));
    }
    return res;

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the explanation here : 

    vector<int> countingSort(vector<int> arr) {
    vector<int> count(100, 0);
    for(int i = 0; i < arr.size(); i++) count[arr[i]]++;
    return count;
}

  • birdmachine007
     + 0 comments

    Python 3:

    def countingSort(arr):
    index_sort = [0] * 100

    for i in arr:
        index_sort[i] += 1

    return index_sort
Load more conversations