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 vote133 views3 answers
Linux kernel write()
C
0 vote154 views1 answer
Bcd to char c
C
1 vote140 views1 answer
C program structure
C
0 vote147 views1 answer
OpenDaylight maven settings
C
0 vote140 views1 answer
C copy 2 strings\
C
-6 votes88 views1 answer
Miniconda version
C
29 votes174 views3 answers
Online embedded c compiler
C
0 vote142 views1 answer
MyFgets in c
C
0 vote171 views1 answer
Malloc contiguous 2d array
C
0 vote151 views1 answer
Largest value in u32
C