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 vote151 views1 answer
Nth fibonacci number java using for loop
Java
1 vote192 views1 answer
Spring serve robots.txt
Java
46 votes177 views2 answers
Java how to print an array
Java
0 vote170 views1 answer
How to import a self written class in java
Java
0 vote173 views1 answer
How do you rate yourself in java
Java
20 votes171 views3 answers
String list to Integer list
Java
0 vote166 views2 answers
Localtime java
Java
-1 vote177 views2 answers
How to disable the cors in spring boot
Java
0 vote121 views1 answer
Convert hashset to arraylist
Java
1 vote173 views1 answer
Java connect mariadb
Java