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 vote150 views1 answer
GetIntExtra(java.lang.String, int)' in 'android.content.Intent' cannot be applied to '(java.lang.String)'
Java
0 vote137 views1 answer
Reading txt file javafx
Java
0 vote158 views1 answer
Print java object inherited classes
Java
0 vote137 views1 answer
Java Find the greatest common divisor of two positive integers. The integers can be large, so you need to find a clever solution.
Java
1 vote156 views1 answer
Validate date java
Java
0 vote139 views1 answer
Calling this in constructor java
Java
2 votes131 views1 answer
For with two values java
Java
17 votes137 views5 answers
Constructor
Java
0 vote134 views5 answers
Comment in Java
Java
0 vote167 views2 answers
Connect 2 package in android
Java