Breaking News: Grepper is joining You.com. Read the official announcement!

Counting Sort C

znarfbay answered on December 14, 2021 Popularity 9/10 Helpfulness 4/10

answer Counting Sort C

Counting Sort C

Comment

#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);
}

Popularity 9/10 Helpfulness 4/10 Language c

Source: Grepper

Tags: c counting-sort

Link to this answer
Share Copy Link

Contributed on Dec 14 2021

znarfbay

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Counting Sort C

Contents

More Related Answers

Counting Sort C

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.