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

5 votes367 views2 answers
Print map in java log
Java
1 vote316 views1 answer
Sort the map by values
Java
0 vote313 views1 answer
Fly dfguyghj: Javascript
Java
0 vote363 views1 answer
How to create space between element in vbox in javafx
Java
0 vote355 views1 answer
Android studio constraint layout proportional height
Java
2 votes335 views1 answer
Textfield set value flutter
Java
1 vote332 views1 answer
Importance of finally block in java
Java
0 vote333 views1 answer
How to Compile the source code in ./src folder with libraries in ./lib folder using JavaSE-1.7
Java
1 vote312 views2 answers
Multidimensional arrays java
Java
6 votes354 views3 answers
Junit 5 expected exception
Java