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 vote59 views1 answer
Java create list of 1 element
Java
0 vote110 views1 answer
Concat result of List to one text java
Java
1 vote91 views2 answers
Spring annotations xml configuration
Java
0 vote104 views1 answer
Uri/beecrowd problem no 1118 solution in Java
Java
1 vote132 views1 answer
Java.lang.nullpointerexception: cannot invoke "java.lang.charsequence.length()" because "this.text" is null
Java
0 vote109 views1 answer
Java anomymous code block
Java
0 vote158 views1 answer
Paper api maven
Java
2 votes117 views1 answer
Jpql spring boot
Java
1 vote52 views1 answer
Number to char
Java
0 vote102 views1 answer
Android java how to stop activity from opening twice programatically
Java