radixSort.cpp

#include <iostream>
using namespace std;
void print(int arr[], int n)
{
    for (int i = 0; i < n; i++)
        cout << arr[i] <<" ";
}

int getMax(int arr[], int n)
{
    int mx = arr[0];
    for (int i = 1; i < n; i++)
        if (arr[i] > mx)
            mx = arr[i];
    return mx;
}

void countSort(int arr[], int n, int exp)
{
    int output[n]; 
    int i, count[10] = { 0 };

    for (i = 0; i < n; i++)
        count[(arr[i] / exp) % 10]++;

    for (i = 1; i < 10; i++)
        count[i] += count[i - 1];

    for (i = n - 1; i >= 0; i--) {
        output[count[(arr[i] / exp) % 10] - 1] = arr[i];
        count[(arr[i] / exp) % 10]--;
    }
    for (i = 0; i < n; i++)
        arr[i] = output[i];
}
void radixsort(int arr[], int n)
{
    int m = getMax(arr, n);
    int count=0;
    for (int exp = 1; m / exp > 0; exp *= 10)
    {
            countSort(arr, n, exp);
            cout<<"Array after "<<++count<<" iteration : ";
            print(arr,n);
            cout<<endl;
    }
}

int main()
{
    cout<<" Enter the size of the array: "<<endl;
    int size;
    cin>>size;
    int arr[size];
    cout<<"  Enter Elements: "<<endl;
    for(int i=0;i<size;i++)
    {
        cin>>arr[i];
    }
    radixsort(arr, size);

    cout<<"Applying Radix Sort"<<endl;
    print(arr, size);
    return 0;
}