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

-1 vote144 views1 answer
Mila Kunis
Java
1 vote123 views1 answer
Pivot in array
Java
5 votes127 views1 answer
Java int to roman
Java
9 votes146 views4 answers
How to wait time in java
Java
-1 vote152 views1 answer
Gson parse json
Java
0 vote134 views1 answer
Java.applet defines how many interfaces
Java
2 votes136 views1 answer
Spigot how to make an inventory
Java
0 vote143 views1 answer
Formatting an integer in java
Java
0 vote160 views1 answer
Java streams example
Java
0 vote141 views1 answer
Permission foreground_service
Java