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 vote152 views1 answer
Set top corner of shape radius programmatically android
Java
0 vote181 views2 answers
Spring boot base url
Java Spring
0 vote154 views1 answer
Access db in fragments
Java
6 votes151 views3 answers
How to take space separated input in java
Java
1 vote177 views3 answers
Spring cors
Java
0 vote206 views1 answer
How to make a button disapear on click in javafx
Java
3 votes149 views2 answers
Java how to change the length of an array
Java
1 vote168 views1 answer
Java string array to one string
Java
0 vote159 views1 answer
Add close button on right top corner of alert dialog box for android
Java
0 vote180 views1 answer
Java basics
Java