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 vote340 views6 answers
GCD
Java
0 vote310 views1 answer
Java see you next happy year
Java
0 vote320 views1 answer
Jlabel text grösse
Java
5 votes313 views1 answer
Kotlin string contains integer
Java
0 vote324 views1 answer
How to get single value from input string in java
Java
0 vote315 views1 answer
Java first character string number
Java
5 votes339 views2 answers
Select java version linux
Java
3 votes303 views1 answer
Java list length
Java
0 vote322 views1 answer
How to put string in char array in java tutorialspoint
Java
0 vote331 views3 answers
Java manajro
Java