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 vote174 views2 answers
Abstract class java
Java
0 vote183 views1 answer
Exceptions you get in java
Java
0 vote267 views1 answer
Spinner event in android
Java
0 vote158 views1 answer
Spring security default username
Java
0 vote266 views1 answer
Python to java converter software
Java
1 vote167 views2 answers
How to recognize a pressed key in java
Java
0 vote190 views1 answer
Java windowbuilder launch on second monitor
Java
0 vote199 views1 answer
Java.lang.noclassdeffounderror: javax/xml/bind/jaxbexception
Java
1 vote190 views2 answers
Android studio set background color transparent
Java
5 votes165 views4 answers
Java string array add element
Java