Radix Sort In Data Structure Using C++

on

Data Structure Using C++

Array Data Structure

Sorting

Radix Sort

int getMax(int arr[], int n);
void countSort(int arr[], int n, int exp);
void radixsort(int arr[], int n);
int main(){
 int arr[]={12,11,13,5,6,4,10,3,14,2};
 int n=sizeof(arr)/sizeof(arr[0]); 
 radixsort(arr,n);
 for(int i=0;i<n;i++){
  cout<<arr[i]<<"\t";
 }
}
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 = arr[0];
    for (int i = 1; i < n; i++){
     if (arr[i] > m)
            m = arr[i];
 }        
    for (int exp = 1; m/exp > 0; exp *= 10)
    {
     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];
 }
}

Let me know in the comment section if you have any question.

Previous Post:
Shell Sort In Data Structure Using C++


Comments

Post a Comment