Question

Sa ordonez crescator un sir; dupa care sa fac un sir ce are jumate ordonat crescator, jumatate ordonat descrescator

Answer 1

#include <iostream>
using namespace std;

int main()
{
int sir1[100],sir2[100],aux,n,i;
cin>>n;
for(i=0;i<n;i++)
cin>>sir1[i];
for(int j=0;j<n;j++)
for(i=0;i<n;i++)
if(sir1[i]<sir1[i-1])
{
aux=sir1[i-1];
sir1[i-1]=sir1[i];
sir1[i]=aux;
}
for(i=0;i<n;i++)
cout<<sir1[i]<<' ';
cout<<endl;
for(i=0;i<(n/2);i++)
sir2[i]=sir1[i];
for(i=0;i<(n/2);i++)
cout<<sir2[i]<<' ';
cout<<endl;
for(int j=i;j<n;j++)
sir2[j]=sir1[j];
for(int j=0;j<n;j++)
cout<<sir2[j]<<' ';
cout<<endl;
for(int j=i;j<n;j++)
if(sir2[j+1]>sir1[j])
{
aux=sir2[j];
sir2[j]=sir2[j+1];
sir2[j+1]=aux;
}
for(int j=0;j<n;j++)
cout<<sir2[j]<<' ';
return 0;
}