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

-2 votes331 views4 answers
Function Template in c++
C++
0 vote181 views1 answer
How to input a vector when size is unknown
C++
0 vote197 views1 answer
Use set to get duplicates in c++
C++
1 vote196 views1 answer
Regex for phone number c++
C++
-1 vote208 views1 answer
Easy c++ code
C++
0 vote190 views1 answer
CamelCase Problem
C++
-2 votes186 views1 answer
How to iterate through array in c++
C++
0 vote226 views1 answer
Free pair c++
C++
1 vote178 views3 answers
On component begin overlap c++
C++
0 vote224 views1 answer
Opencv c++ feature detection
C++