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 views1 answer
Reader from string java
Java
20 votes147 views2 answers
Color from hex code flutter
Java
18 votes180 views3 answers
How to convert a string to char in java
Java
1 vote147 views1 answer
Java take screenshot
Java
39 votes156 views5 answers
Random number generator java with range
Java
2 votes159 views1 answer
How to check even odd in java using bitwise operator
Java
5 votes195 views2 answers
Java print type of object
Java
2 votes151 views1 answer
Java cartesian to polar
Java
2 votes146 views1 answer
Password encryption and decryption in java
Java
0 vote160 views1 answer
Os compatible java path separator
Java