Scribd Logo
Upload

Welcome to Scribd!

  • 9 views

    Radix Sort

    Uploaded by

    nithishvv3010
    This C++ program implements radix sort to sort an array of integers. It defines functions to get the maximum element, perform counting sort on an array with a given digit, perform radix sort by repeatedly calling counting sort, and print the sorted array. The main function passes an unsorted integer array to radix sort, prints the sorted array, and returns 0.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    Radix Sort

    Uploaded by

    nithishvv3010
    9 views1 page
    This C++ program implements radix sort to sort an array of integers. It defines functions to get the maximum element, perform counting sort on an array with a given digit, perform radix sort by repeatedly calling counting sort, and print the sorted array. The main function passes an unsorted integer array to radix sort, prints the sorted array, and returns 0.

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This C++ program implements radix sort to sort an array of integers. It defines functions to get the maximum element, perform counting sort on an array with a given digit, perform radix sort by repeatedly calling counting sort, and print the sorted array. The main function passes an unsorted integer array to radix sort, prints the sorted array, and returns 0.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    9 views1 page

    Radix Sort

    Uploaded by

    nithishvv3010
    This C++ program implements radix sort to sort an array of integers. It defines functions to get the maximum element, perform counting sort on an array with a given digit, perform radix sort by repeatedly calling counting sort, and print the sorted array. The main function passes an unsorted integer array to radix sort, prints the sorted array, and returns 0.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    You are on page 1of 1

    #include<iostream>

    using namespace std;


    int getMax(int arr[],int n){
    int max=arr[0];
    for(int i=1;i<n;i++){
    if(arr[i]>max){
    max=arr[i];
    }
    }return max;
    }
    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=0;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);
    for(int exp=1;m/exp>0;exp*=10){
    countsort(arr,n,exp);
    }
    }
    void print(int arr[],int n){
    cout<<"The sorted array is: "<<"\n";
    for(int i=0;i<n;i++){
    cout<<arr[i]<<" ";
    }
    }
    int main(){
    int arr[]={17,45,75,90,802,24,2,66};
    int n=sizeof(arr)/sizeof(arr[0]);
    radixsort(arr,n);
    print(arr,n);
    return 0;
    }

    You might also like