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 vote330 views1 answer
C++ average
C++
0 vote283 views1 answer
Find the max element along with it's index in c++
C++
0 vote301 views7 answers
Hexo
C++
1 vote281 views1 answer
How to modify set C++
C++
0 vote300 views1 answer
Pause the console c++
C++
4 votes267 views2 answers
Sqrt cpp
C++
1 vote286 views1 answer
How to round to nearest whole number unity
C++
0 vote293 views1 answer
How to type cast quotient of two integers to double with c++
C++
0 vote270 views1 answer
Equals operator c++ overlaod
C++
-1 vote279 views5 answers
C++ string split
C++