//Function to get the largest element from an array
int getMax(int array[], int n)
{
int max = array[0];
for (int i = 1; i < n; i++)
if (array[i] > max)
max = array[i];
return max;
}
//Using counting sort to sort the elements in the basis of significant places
void countSort(int array[], int size, int place)
{
constint max = 10;
int output[size]; // Where the error is occuring
int count[max];
for (int i = 0; i < max; ++i)
count[i] = 0;
//Calculate count of elements
for (int i = 0; i < size; i++)
count[(array[i] / place) % 10]++;
//Calculating cumulative count
for (int i = 1; i < max; i++)
count[i] += count[i - 1];
//Placing the elements in sorted order
for (int i = size - 1; i >= 0; i--)
{
output[count[(array[i] / place) % 10] - 1] = array[i];
count[(array[i] / place) % 10]--;
}
for (int i = 0; i < size; i++)
array[i] = output[i];
}
//Main function to implement radix sort
void radixsort(int array[], int size)
{
//Getting maximum element
int max = getMax(array, size);
//Applying counting sort to sort elements based on place value.
for (int place = 1; max / place > 0; place *= 10)
countSort(array, size, place);
}
//-------------------------------------------------
// printArray: prints the array that has been sorted
// array[]: The array of numbers
// size: The size of the array
// -------------------------------------------------
void printArray(int array[], int size)
{
// For loop that prints out the sorted numbers of the array
for (int i = 0; i < size; i++)
std::cout << " " << array[i];
}