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

Counting Sort 1

Sort by

recency

|

274 Discussions

|

  • exelure
     + 0 comments

    Golang

    func countingSort(arr []int32) []int32 {
    frequency := make([]int32, 100)
    for _, v := range arr {
        frequency[v]++
    }
    return frequency
}

  • anarod_val25
     + 0 comments

    C++20 ` vector countingSort(vector arr) { vector frequency(100); std::fill(frequency.begin(), frequency.end(), 0);

    for (int n : arr){
    frequency[n]++;
}

for(int n : frequency){
    std::cout<<n<<" ";
}

return frequency;

    } `

  • calancea_bianca1
     + 0 comments

    Python

    def countingSort(arr):
    # Write your code here
    counting=[0]*100
    
    for i in arr:
        counting[i]+=1
        
    return counting

  • anthonymarchenko
     + 0 comments

    Swift

    func countingSort(arr: [Int]) -> [Int] {
    // Write your code here
    let maxNumber = arr.max()
    var array: [Int] = Array.init(repeating: 0, count: arr.count)
    for item in arr {
        array[item] = array[item] + 1
    }

   return Array(array[0..<100])
}

  • fazepavan
     + 0 comments
    def countingSort(arr):
    # Write your code here
    freq = [0]*100
    for i in range(len(arr)):
        freq[arr[i]] += 1
    return freq