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 vote288 views1 answer
How to stop screen going off android studio
Java
0 vote269 views3 answers
Resttemplate get rest api call in java
Java
17 votes261 views1 answer
String to date conversion java
Java
-1 vote263 views1 answer
Java GraphicsOperations.drawLine
Java
2 votes285 views1 answer
Java reverse linked list
Java
0 vote231 views1 answer
Parentheses in java
Java
1 vote292 views1 answer
Shakescleare merchant of venice
Java
2 votes252 views3 answers
How to convert int to integer in java
Java
0 vote293 views1 answer
What is serialization and deserialization in rest assured
Java
1 vote308 views1 answer
Java radnom
Java