Counting Sort C

#include <stdio.h>
void CountingSort(int A[], int k) {
  int B[10];
  int max = A[0];
  for (int i = 1; i < k; i++) {
    if (A[i] > max)
      max = A[i];
  }
  int C[10];
  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];
  }
}
void printA(int A[], int k) {
  for (int i = 0; i < k; ++i) {
    printf("%d  ", A[i]);
  }
  printf("\n");
}
int main() {
  int A[] = {4, 2, 2, 8, 3, 3, 1};
  int n = sizeof(A) / sizeof(A[0]);
  CountingSort(A, n);
  printA(A, n);
}

Similar codes

10 votes316 views2 answers
Linux sleep with exec /bin/sleep
C
0 vote335 views1 answer
WAP to create Database using array of structure & display it in C
C
1 vote309 views1 answer
Populate a map c++
C
0 vote387 views1 answer
C# for loop decrement
C
0 vote304 views1 answer
How to ban websites on mac
C
0 vote346 views1 answer
Ssl_get_servername return null
C
0 vote318 views1 answer
C static
C
1 vote328 views1 answer
C return
C
0 vote340 views1 answer
Vbl share price
C
1 vote350 views1 answer
Material-ui Roboto font
C