Răspuns:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <fstream>
#include <bitset>
#include <vector>
#include <cstring>
using namespace std;
ifstream in("vector.in");
int a[21],n;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>a[i];
bool sortat;
do
{
sortat=true;
for(int i=1;i<n;i++)
if(a[i]>a[i+1])
{
swap(a[i],a[i+1]);
sortat=false;
}
}
while(!sortat);
//crescator
for(int i=1;i<=n;i++)
cout<<a[i]<<' ';
cout<<'\n';
//descrescator
for(int i=n;i>=1;i--)
cout<<a[i]<<' ';
return 0;
}
