Question

5.35 LAB: Sort a vector

Write a program that gets a list of integers from input, and outputs the integers in ascending order (lowest to highest). The first integer indicates how many numbers are in the list. Assume that the list will always contain less than 20 integers.

Ex: If the input is:

5 10 4 39 12 2

the output is:

2 4 10 12 39

For coding simplicity, follow every output value by a space, including the last one.

Your program must define and call the following function. When the SortArray function is complete, the vector passed in as the parameter should be sorted.
void SortVector(vector<int>& myVec)

#include <iostream>
#include <vector>

using namespace std;

void vector_sort(vector<int> &vec) {
    int i, j, temp;
    for (i = 0; i < vec.size(); ++i) {
        for (j = 0; j < vec.size() - 1; ++j) {
            if (vec[j] > vec[j + 1]) {
                temp = vec[j];
                vec[j] = vec[j + 1];
                vec[j + 1] = temp;
            }
        }
    }
}

int main() {
    int size, n;
    vector<int> v;
    cin >> size;
    for (int i = 0; i < size; ++i) {
        cin >> n;
        v.push_back(n);
    }
    vector_sort(v);
    for (int i = 0; i < size; ++i) {
        cout << v[i] << " ";
    }
    cout << endl;
    return 0;
}

Answer 1

#include <iostream>
#include <vector>

using namespace std;

void SortVector(vector<int> &myVec) {
    int i, j, temp;
    for (i = 0; i < myVec.size(); ++i) {
        for (j = 0; j < myVec.size() - 1; ++j) {
            if (myVec[j] > myVec[j + 1]) {
                temp = myVec[j];
                myVec[j] = myVec[j + 1];
                myVec[j + 1] = temp;
            }
        }
    }
}

int main() {
    int size, n;
    vector<int> v;
    cin >> size;
    for (int i = 0; i < size; ++i) {
        cin >> n;
        v.push_back(n);
    }
    SortVector(v);
    for (int i = 0; i < size; ++i) {
        cout << v[i] << " ";
    }
    cout << endl;
    return 0;
}