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 vote125 views1 answer
Java servlet life cycle
Java
1 vote120 views1 answer
Reflections java
Java
0 vote109 views1 answer
Enlist Operations in ComboBox (Addition, Subtraction, Division, Multiplication in java
Java
0 vote119 views1 answer
Java opts
Java
0 vote119 views1 answer
Re-loop after last item in array java
Java
0 vote125 views1 answer
Watch service java
Java
0 vote114 views1 answer
How to convert some letters to lowercase java
Java
0 vote185 views1 answer
Android checkbox tint color
Java
5 votes136 views6 answers
Pagination
Java
1 vote146 views1 answer
Declaration and definition of array in java
Java