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 vote132 views3 answers
Bundletool aab to apk
Java
0 vote125 views1 answer
How to change the first activity on android
Java
0 vote117 views2 answers
Andriod button wont change color
Java
1 vote158 views1 answer
Java outer class
Java
0 vote126 views1 answer
Enum type spring boot entity
Java
0 vote136 views2 answers
Split string to textview in android
Java
10 votes163 views1 answer
Java try catch
Java
8 votes133 views3 answers
Check if a string is empty java
Java
6 votes145 views1 answer
Android studio webview mailto
Java
6 votes133 views2 answers
Spring boot postgres
Java