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 vote182 views3 answers
Add two variables in java
Java
0 vote197 views1 answer
I need a generic class which extends User class which implement an interface
Java
0 vote177 views1 answer
Java what is at
Java
-2 votes218 views2 answers
Ceil function in java
Java
14 votes198 views2 answers
How to print a 2d array in java
Java
6 votes208 views2 answers
Java array check duplicates
Java
0 vote230 views1 answer
Java how to use log
Java
1 vote170 views1 answer
Java max int value
Java
3 votes227 views2 answers
How to unistall java
Java
-2 votes213 views1 answer
Enhanced for-loop,
Java