Question

Instruction: In C++ 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 numbers where each number has a value in {0, 1, 2, 3}. Entries of a vector are separated by a space.

NOTE: READ THE INSTRUCTIONS PLEASE. DO NOT JUST COPY & PASTE CODE.

Examples of input and output Input 3333322222 2322222222 1300210000 1300220000 2321222222 Output :2 3:3:3:3:3:2:2:2:2:2; 22002 00222 22002 00222 22002 00222 22002 00222 22-22 12222 32222 22223 32001 00123 32002 u00223 33333 it 33333 532112 C 11223

Answer 1

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    vector<vector<int> > VECT;
    int n, n1;
    cout<<"Enter number of vectors: ";
    cin>>n;
    for(int i = 0; i < n; i++)
    {
        vector<int> vect; // create vector of vectors.
        for(int j = 0; j < 10; j++){
           cin>>n1;
            vect.push_back(n1);
        }
        VECT.push_back(vect); //store vectors into VECTOR
    }
    sort(VECT.begin(), VECT.end());
    cout<<"outPut: \n";
    for(int i = 0; i < VECT.size(); ++i)
    {
        for(int j = 0; j < VECT[i].size(); ++j)
            cout << VECT[i][j]<<";";
        cout << endl;
    }

    return 0;
}

Sh-4.2 main Enter number of vectors: 3 3 3 3 3 111145 ΘΘΘ2344322 outPut: 0,0,0,2,3,4;4;3,2,2; sh-4.2$