Counting Sort C++

#include <iostream>
using namespace std;

void CSort(int A[], int k) {
  int B[10];
  int C[10];
  int max = A[0];

  for (int i = 1; i < k; i++) {
    if (A[i] > max)
      max = A[i];
  }
  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++)
    cout << A[i] << " ";
  cout << endl;
}
int main() {
  int A[] = {3, 0, 4, 1, 3, 4, 1, 4};
  int n = sizeof(A) / sizeof(A[0]);
  CSort(A, n);
  printA(A, n);
}

Similar codes

0 vote96 views1 answer
Convert ascii char value to hexadecimal c++
C++
1 vote123 views1 answer
Master header file c++
C++
0 vote173 views1 answer
Ind the number of digits of a given integer n .
C++
0 vote95 views1 answer
SET TO NULL pointer c++
C++
0 vote106 views1 answer
Cocos2d c++ linux
C++
0 vote101 views1 answer
Log base 10 c+_+
C++
-2 votes58 views1 answer
2d array
C++
0 vote106 views1 answer
How to write a template c++
C++
0 vote102 views1 answer
Finding no of unique characters in a string c++
C++
1 vote106 views2 answers
Substring function in c++
C++