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 vote393 views1 answer
How to remove backstack fragment
Java
2 votes318 views1 answer
Primefaces calendar min date validation
Java
1 vote364 views1 answer
Has integer java
Java
1 vote392 views1 answer
Char cannot be converted to string
Java
0 vote351 views1 answer
Converting String Array to an Integer Array
Java
0 vote376 views1 answer
Java class creation inside method
Java
45 votes345 views6 answers
Java string to char array
Java
0 vote310 views1 answer
Java initialize list with default value
Java
0 vote435 views1 answer
Spring boot save file to static folder
Java Spring
2 votes329 views1 answer
Java random uuid
Java