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

-1 vote164 views1 answer
Que es un length en java
Java
0 vote121 views1 answer
Spring send parameter to url
Java
0 vote164 views3 answers
Tostring in java
Java
0 vote204 views1 answer
Spring boot put invalid cors request
Java Spring
0 vote241 views1 answer
How to convert timestamp to time in java
Java
1 vote192 views1 answer
Inputing number in java
Java
0 vote179 views1 answer
Unprocessed continuation reference(s) remaining name
Java
5 votes178 views2 answers
Jljjd;lja;ldkjalkddfjlkadf;laskjdfp9epifjeklfjkjwl2ODJwlkfndsopfksopjfsdifoasncdl cmk ]-0cd'f d
Java
0 vote247 views1 answer
Java socket get ip address of client
Java
2 votes163 views1 answer
Boxing and unboxing in java
Java