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 vote339 views4 answers
Findbyname in jpa
Java
0 vote390 views1 answer
Procedure java
Java
0 vote392 views2 answers
Convert void * to int
Java
24 votes375 views3 answers
First java program
Java
13 votes385 views6 answers
Java string format 2 decimal places
Java
26 votes329 views3 answers
Java random between
Java
5 votes353 views3 answers
Console log java
Java
0 vote340 views1 answer
Janaaa_Sa
Java
0 vote349 views1 answer
Do function after time android studio
Java
0 vote371 views1 answer
Reverse arraylist java recursion
Java