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 vote105 views1 answer
Java scanner class time
Java
12 votes226 views2 answers
Run spring boot application command line
Java Spring
-1 vote120 views1 answer
Spring jpa query with union all
Java
0 vote123 views1 answer
Spring boot jackson infinite recursion
Java Spring
0 vote115 views2 answers
Define nasty
Java
1 vote135 views1 answer
Equivalent to params keyword in java
Java
0 vote102 views1 answer
Java get longest string in array
Java
1 vote105 views2 answers
Android unit testing
Java
0 vote108 views1 answer
Quick sort in java progrmmieren
Java
0 vote120 views2 answers
Android studio pass value to another activity
Java