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

0 vote119 views1 answer
Hgggggggggggggggg
C
1 vote121 views1 answer
Windeployqt example
C
0 vote59 views1 answer
Turn on and turn off different device at the same time in rainmaker
C
39 votes230 views5 answers
Fahrenheit to celsius formula
C
0 vote114 views1 answer
Logical operators
C
0 vote113 views1 answer
MyFgets in c
C
4 votes57 views1 answer
Rxjs npm
C
0 vote119 views1 answer
What is string::npos
C
0 vote102 views1 answer
Code for qsort in C with swap
C
2 votes122 views1 answer
What are the 3 basic types of Plate Boundaries? Explain their differences (how they act).
C