Skip to content
the poor coder

Hackerrank Vector-Sort Solution

Poor Man
Published
Updated
Reading time
2 min read

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

Declaration:

Text
vector<int>v; (creates an empty vector of integers)

Size:

Text
int size=v.size();

Pushing an integer into a vector:

Text
v.push_back(x);(where x is an integer.The size increases by 1 after this.)

Popping the last element from the vector:

Text
v.pop_back(); (After this the size decreases by 1)

Sorting a vector:

Text
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  where  is the number of integers. The next line contains  integers.
Constraints

, where  is the  integer 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

Text
5
1 6 10 8 4

Sample Output

Text
1 4 6 8 10

Solution in cpp#

Approach 1.

Python
#include <bits/stdc++.h>

using namespace std;

int main()
{
 vector<long long>v;
 long long int i,n,x;
 cin>>n;
 for(i=0;i<n;i++)
 { cin>>x;
  v.push_back(x);
 }

 sort(v.begin(),v.end());

 for(i=0;i<n;i++)
 cout<<v[i]<<" ";
 
 cout<<endl;
 
 return 0;
}

Approach 2.

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


int main() {
	int i, n;
	int size;
	string line;
    vector<int> v;

    cin >> size;
    
    for(i = 0; i < size; i++) {
        cin >> n;
        v.push_back(n);
    }
    
    sort(v.begin(), v.end());

	for (i = 0; i < v.size(); i++) {
		cout << v[i] << ' ';
	}

	

	
	return 0;
}

Approach 3.

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


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    int size,n;
    cin>>size;
    vector<int> v;
    for(int i =0; i<size;i++){
        cin>>n;
        v.push_back(n);
    }
    sort(v.begin(),v.end());
    for(int i =0;i<size;i++){
        cout<<v[i]<<" ";
    }
    
    return 0;
}

Keep going

2020

Hackerrank Deque-STL Solution

Double ended queue or Deque(part of C++ STL) are sequence containers with dynamic sizes that can be expanded or contracted on both ends (either its front or its back). The member functions of deque that are mainly used…

2020

Hackerrank Print Pretty Solution

Your manager gave you a text file with many lines of numbers to format and print. For each row of space-separated doubles, format and print the numbers using the specifications in the Output Format section below. Input…

2020

Hackerrank Maps-STL Solution

Maps are a part of the C++ STL.Maps are associative containers that store elements formed by a combination of a key value and a mapped value, following a specific order.The mainly used member functions of maps are: Map…

ESC