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

10 votes203 views5 answers
Sort 2d array by column java
Java
0 vote176 views10 answers
Convert kotlin code to java online
Java
1 vote195 views1 answer
Java 8 hash list
Java
0 vote189 views1 answer
Polymorphism array with abstract class java
Java
6 votes194 views5 answers
Remove duplicates from list java
Java
0 vote184 views1 answer
Could not resolve project :app
Java
0 vote214 views1 answer
Thymeleaf spring boot dependency for mail
Java
2 votes233 views2 answers
Java double to float
Java
0 vote191 views1 answer
Android notification addaction example
Java
0 vote194 views1 answer
Permission foreground_service
Java