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 vote249 views1 answer
Gradle reflections
Java
1 vote251 views1 answer
Spring boot id auto generated
Java
0 vote198 views2 answers
Java replaceall regex
Java
0 vote193 views1 answer
Number of zeros in a binary array
Java
1 vote213 views3 answers
Last resultset method
Java
0 vote200 views5 answers
Java arraylist
Java
0 vote229 views1 answer
Android separator line in view
Java
0 vote203 views1 answer
Handle customized popup in selenium
Java
0 vote191 views1 answer
Mobile number validation to edittext in android
Java
0 vote215 views2 answers
Android listen to network change
Java