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 vote214 views1 answer
Is it possible to access argv in function
C
0 vote192 views1 answer
How to malloc for matrix in c
C
11 votes220 views6 answers
C malloc
C
0 vote200 views1 answer
Esp32 dhcp server
C
0 vote251 views1 answer
String to doublein c
C
0 vote205 views1 answer
Gitlab ci heroku
C
0 vote180 views1 answer
Postgres login mac
C
1 vote185 views1 answer
Standard_init_linux.go:211: exec user process caused "exec format error"
C
0 vote246 views1 answer
Limit axis in one direction plt
C
1 vote191 views1 answer
Linux play youtube audio only
C