Problem Name: Vector-Sort

Problem Link:

In this HackerRank Functions in C++ programming problem solution,

You are given N integers.Sort the N integers and print the sorted order.
Store the N ntegers in a vector.Vectors are sequence containers representing arrays that can change in size.

  • Declaration:

    vector<int>v; (creates an empty vector of integers)
  • Size:

    int size=v.size();
  • Pushing an integer into a vector:

    v.push_back(x);(where x is an integer.The size increases by 1 after this.)
  • Popping the last element from the vector:

    v.pop_back(); (After this the size decreases by 1)
  • Sorting a vector:

    sort(v.begin(),v.end()); (Will sort all the elements in the vector)


To know more about vectors, Click Here

Input Format

The first line of the input contains N where N is the number of integers. The next line contains N integers.


1 <= N <= 10**5

1 <= Vi <= 10**9, where Vi is the i**th nteger in the vector.

Output Format

Print the integers in the sorted order one by one in a single line followed by a space.

Sample Input

1 6 10 8 4

Sample Output

1 4 6 8 10




Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

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

int main()
    int n;
    cin >> n;
    vector v;

    for(int i = 0, k; i < n; i++){
        cin >> k;
    sort(v.begin(), v.end());

    for(int i : v)
        cout << i << " ";
    cout << endl;

    return 0;
Copy The Code & Try With Live Editor


5 1 6 10 8 4


1 4 6 8 10


[Solved] Box It! in C++ solution in Hackerrank - Hacerrank solution C++
[Solved] Lower Bound-STL in C++ solution in Hackerrank - Hacerrank solution C++