What is the pseudo code of radix sort in C?

Answer 1

step 1: Analyse the radix sort procedure first.

step 2:Convert the procedure in to the c coding

#include<stdio.h>

#define MAX 5

#define SHOWPASS

void print(int *a,int n)

{

int i;

for(i=0;i

printf("%d\t",a[i]);

}

void radixsort(int *a,int n)

{

int i,b[MAX],m=0,exp=1;

int bucket[10]={0};

for(i=0;i

{

if(a[i]>m)

m=a[i];

}

while(m/exp>0)

{

for(i=0;i

bucket[a[i]/exp%10]++;

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

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

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

b[--bucket[a[i]/exp%10]]=a[i];

for(i=0;i

a[i]=b[i];

exp*=10;

#ifdef SHOWPASS

printf("\nPASS : ");

print(a,n);

#endif

}

}

int main()

{

int arr[MAX];

int i,n;

printf("Enter total elements (n < %d) : ",MAX);

scanf("%d",&n);

printf("Enter %d Elements : ",n);

for(i=0;i

scanf("%d",&arr[i]);

printf("\nARRAY : ");

print(&arr[0],n);

radixsort(&arr[0],n);

printf("\nSORTED : ");

print(&arr[0],n);

printf("\n");

return 0;

}

You can see the the same program with output in related links, below.

Answer 2

These are basically the instructions written in plain English to solve any problem. It makes a layman understand the complexity of the problem. Pseudo is a way of describing and algorithm without using any specific programming language. It can be the example of real life examples, but it cannot be implemented in computer. It is written roughly at same level of detail.