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 vote125 views1 answer
How to search in a file in c
C
17 votes120 views3 answers
Edit PATH linux
C
0 vote177 views1 answer
Gandhi ashram saharanpur
C
2 votes126 views2 answers
Tainted love
C
3 votes123 views1 answer
How to replace a number in an array in the console for c programming
C
0 vote137 views1 answer
Python project script run
C
3 votes128 views1 answer
Error: 'for' loop initial declarations are only allowed in C99 or C11 mode
C
1 vote194 views1 answer
C check if char is an operator
C
0 vote127 views1 answer
C how to check a palindrome string
C
0 vote128 views1 answer
C bitwise invert
C