Question

Please use counting sort.

RadixSort In this assignment you will im Input structure You are going to apply RADIXSORT to sort vectors. The input starts with an integer number which indicates the number of vectors to be sorted. Then vectors follow, one vector per line. Each vector consists of 10 digits where each digit has a value in 0...9. Entries of a vector are separated by a space Output structure Output the sorted sequence of vectors, one per line. Vector i must appear before vector j in your output if and only if for some d E ,2,..., 10), vector i is smaller than or equal to vector j on the dth entry, and the two vectors are equal for any of the first d-1 entries.

Answer 1

I would be providing my solution in C++ as it was not asked for a particular language to implement RADIX SORT.

The idea is to sort digit by digit starting from the least significant digit and moving to the most significant digit. Here counting-sort is used as a subroutine to sort.

Here is the Code:

#include <bits/stdc++.h>

using namespace std;

void countSort(vector<int> v[],int n,int dig)

{ // A function to do counting sort of array of vector according to the digit represented by dig.

vector<int> out[n]; // output array of vector

int i;

int count[10] = {0};

for (i = 0; i < n; i++){  

vector<int> x=v[i];// Store count of occurrences in count[]

int c=x[dig];//extract the digit of the vector v[i] at 'dig' position

count[c]++;

}

for (i = 1; i < 10; i++)// Change count[i] so that count[i] now contains actual position of this digit in output[]

{

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

}

for (i = n - 1; i >= 0; i--)// Construct the output array of vector

{

out[count[ v[i][dig] ] - 1] = v[i];//read carefully how the index is manipulated relating arr[], ccount, output.

count[ v[i][dig] ]--;

}

for (i = 0; i < n; i++)// Copy the output(out) array of vector to v[] so that v[] now contains sorted numbers

//according to current digit

{  

v[i] = out[i];

}

}

void RadixSort(vector<int> v[],int n)

{ //The idea is to sort digit by digit starting from the least significant digit and moving to the most significant digit.   

for (int i = 9;i>=0; i--)//Here counting-sort is used as a subroutine to sort.

//We have no of digits =10 and 10th digit is least significant digit

{

countSort(v,n,i);//passing ith digit to solve in v vector

}

}

void print_vector(vector<int> v[],int n)

{

int i,j;

for(i=0;i<n;i++)

{

for(j=0;j<v[i].size();j++)

{

cout<<v[i][j];

}

cout<<"\n";

}

}

int main() {

int n;

cin>>n;//No of Vectors to Sort

int i,j;

vector<int> v[n+1];//To store n vectors declare array of vectors

for(i=0;i<n;i++)

{

for(j=0;j<10;j++)//Each vector will store 10 digit mentioned in the input structure

{

int c;

cin>>c;

v[i].push_back(c);//push the required digit in required vector

}

}

cout<<"Array of Vector Before Sorting"<<"\n";

print_vector(v,n);//print vector before sorting

RadixSort(v,n);//Radix Sort

cout<<"Array of Vector After Sorting"<<"\n";

print_vector(v,n);

return 0;

}

Input:

5
4 3 4 1 5 6 7 7 8 5
2 3 4 1 5 6 7 7 8 9
4 3 4 1 5 6 7 7 8 6
8 3 4 1 5 6 7 7 8 6
4 3 4 1 5 6 7 9 8 4

Output:

Array of Vector After Sorting
2341567789
4341567785
4341567786
4341567984
8341567786

Thanks and Please Upvote