Counting sort java

public static void CountingSort(int A[], int k) {//k is equal to A.length
        int[] B = new int[k + 1];
        int max = A[0];
        for (int i = 1; i < k; i++) {
            if (A[i] > max)
                max = A[i];
        }
        int[] C = new int[max + 1];
        for (int i = 0; i < max; ++i) {
            C[i] = 0;
        }
        for (int i = 0; i < k; i++) {
            C[A[i]]++;
        }
        for (int i = 1; i <= max; i++) {
            C[i] += C[i - 1];
        }
        for (int i = k - 1; i >= 0; i--) {
            B[C[A[i]] - 1] = A[i];
            C[A[i]]--;
        }
        for (int i = 0; i < k; i++) {
            A[i] = B[i];
        }
    }

Similar codes

2 votes194 views1 answer
Convert python to java translator online
Java
0 vote239 views1 answer
Date(Long) to integer and back
Java
10 votes217 views2 answers
Java substring one parameter
Java
5 votes236 views1 answer
Java search arraylist
Java
0 vote268 views1 answer
Get free player inventory slots spigot
Java
0 vote268 views2 answers
Matrix Diagonal Sum
Java
11 votes243 views2 answers
Java list to set
Java
0 vote219 views1 answer
Css svg data uri
Java
0 vote242 views1 answer
Using handler runnable for refresh android
Java
2 votes239 views3 answers
Add comment in java
Java