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 vote323 views1 answer
Another name for coffee
Java
0 vote337 views1 answer
Wrap text in jscrollpane
Java
0 vote321 views1 answer
Java jackson optional
Java
-1 vote342 views1 answer
Mysql connection details in springboot
Java
0 vote332 views1 answer
Java toggle button get state
Java
26 votes362 views10 answers
Netflix
Java
12 votes356 views3 answers
How to use arrays java
Java
1 vote339 views1 answer
Reflections java
Java
30 votes361 views6 answers
For each loop in java
Java
0 vote333 views1 answer
How to clear a stringbuffer in java
Java