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

1 vote173 views1 answer
Como declarar uma string em c
C
0 vote219 views1 answer
C check if array is empty
C
1 vote201 views1 answer
Array reference argument
C
0 vote207 views1 answer
Qgraphicsscene save all items to file
C
0 vote198 views1 answer
PATH_MAX
C
2 votes179 views1 answer
Change the user group of folder linux
C
0 vote192 views7 answers
Convert c to python online
C
0 vote187 views1 answer
YOUNG SEX PARTY underground collection
C
9 votes202 views2 answers
Bash: apt-add-repository: command not found
C
0 vote206 views1 answer
Turn a char array into double C
C