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 vote184 views1 answer
C++ localtime unsafe
C++
24 votes184 views5 answers
Size of array
C++
0 vote186 views1 answer
Assign array to array
C++
1 vote177 views1 answer
Eosio get time
C++
1 vote171 views1 answer
Accumulate c++
C++
1 vote157 views1 answer
How to add colored text in c++
C++
17 votes179 views4 answers
Max element in vector c++
C++
0 vote149 views1 answer
Targon lol
C++
3 votes173 views2 answers
Fast Inverse Square Root
C++
5 votes186 views6 answers
Ngrok http
C++