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

0 vote221 views1 answer
Set precision in java
Java
0 vote204 views1 answer
Java jbutton trigger action
Java
6 votes221 views2 answers
Document.set() firebasefirestore java
Java
0 vote175 views1 answer
Close searchview android java
Java
-1 vote194 views3 answers
Cors spring
Java
0 vote190 views1 answer
Using automapper without dependency injection
Java
0 vote156 views1 answer
Convert hashset to arraylist
Java
0 vote215 views2 answers
Darkhub
Java
4 votes206 views1 answer
How to change theme of app in android studio programmatically
Java
1 vote207 views1 answer
Java question mark operator
Java