Search:

Submit Article

# Program to illustrate the Radix Sort

Posted By: Easy Tutor     Category: C++ Programming     Views: 18533

## Code for Program to illustrate the Radix Sort in C++ Programming

``` # include <iostream.h>
# include <conio.h>

# define array_size 10

main( )
{
clrscr( );

long array[array_size]={0};

cout<<"\n ******************************************************************************"<<endl;
cout<<" ******************************************************************************"<<endl;

cout<<"\n * Array size = 10"<<endl;
cout<<" * Data Type = long"<<endl;

gotoxy(1,24);
cout<<" ******************************************************************************";
gotoxy(1,25);
cout<<" ******************************************************************************";

gotoxy(1,10);
cout<<" Enter the array : "<<endl<<endl;

for(int count_1=0;count_1<array_size;count_1++)
{
cout<<"\t Element["<<count_1<<"] = ";
cin>>array[count_1];
}

gotoxy(40,10);
cout<<" Sorted Array : ";

for(int count_2=0;count_2<array_size;count_2++)
{
gotoxy(50,12+count_2);
cout<<"Element["<<count_2<<"] = "<<array[count_2]<<endl;
}

getch( );
return 0;

}

{
int largest_element=array[0];

for(int count_1=0;count_1<array_size;count_1++)
{
if(array[count_1]>largest_element)
largest_element=array[count_1];
}

int maximum_digits=0;
int temp=largest_element;

do
{
temp/=10;
maximum_digits++;
}
while(temp>0);

for(int count_2=0;count_2<maximum_digits;count_2++)
{
int queue[10][array_size]={0};
int front[10];
int rear[10];

for(int count_3=0;count_3<10;count_3++)
{
front[count_3]=-1;
rear[count_3]=-1;
}

for(int count_4=0;count_4<array_size;count_4++)
{
int temp=array[count_4];

for(int count_5=0;count_5<count_2;count_5++)
temp/=10;

int significant_digit=temp%10;

if(rear[significant_digit]==-1)
{
rear[significant_digit]=0;
front[significant_digit]=0;
}

else
rear[significant_digit]++;

queue[significant_digit][rear[significant_digit]]=
array[count_4];
}

int count_6=0;
int count_7=0;

do
{
if(front[count_7]==0)
{
do
{
array[count_6]=queue[count_7][front[count_7]];
front[count_7]++;
count_6++;
}
while(front[count_7]<=rear[count_7]);
}

count_7++;
}
while(count_6<array_size);

}
}
```
Share:

Didn't find what you were looking for? Find more on Program to illustrate the Radix Sort Or get search suggestion and latest updates.

 Easy Tutor author of Program to illustrate the Radix Sort is from United States. Easy Tutor says Hello Friends,I am Free Lance Tutor, who helped student in completing their homework. I have 4 Years of hands on experience on helping student in completing their homework. I also guide them in doing their final year projects.I have share many programs on this website for everyone to use freely, if you need further assistance, than please contact me on easytutor.2ya [at the rate] gmail [dot] comI have special discount scheme for providing tutor services. I am providing tutor service to students from various contries, currently most of my students are from United States, India, Australia, Pakistan, Germany, UK and Canada. I am also here to expand my technical network to receive more opportunity in my career, make friends to help them in resolving their technical problem, learn and share my knowledge, If you like to be my friend, Please send me friend request.Thanks,Happy Programming :) View All Articles

 Please enter your CommentComment should be atleast 30 Characters.Please put code inside [Code] your code [/Code]. No Comment Found, Be the First to post comment!