{

int mx = arr[0];

for (int i = 1; i < n; i++)

if (arr[i] > mx)

mx = arr[i];

return mx;

{

int output[n]; // output array

int i, count[10] = {0};

// Store count of occurrences in count[]

for (i = 0; i < n; i++)

count[ (arr[i]/exp)%10 ]++;

// Change count[i] so that count[i] now contains actual

// position of this digit in output[]

for (i = 1; i < 10; i++)

count[i] += count[i - 1];

// Build the output array

for (i = n - 1; i >= 0; i--)

{

output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];

count[ (arr[i]/exp)%10 ]--;

}

// Copy the output array to arr[], so that arr[] now

// contains sorted numbers according to current digit

for (i = 0; i < n; i++)

arr[i] = output[i];

{

// Find the maximum number to know number of digits

int m = getMax(input, n);

for (int exp = 1; m/exp > 0; exp *= 10)

countSort(input, n, exp);

{

int input[] = {3001, 42, 122, 9, 612, 501}; // The number of iterations would depend upon the max number of digits

int size = sizeof(input)/ sizeof(int);

radixSort(input, size);

cout << "Sorted Array: ";

for (int i = 0; i < size; i++)

{

cout << input[i] << " ";

}

cout << endl;