Max min

int v[1001], n, i, min, max;

cin>>n;

for(i=0;i<n;i++)

cin>>v[i];

min=v[0];

max=v[0];

for(i=1;i<n;i++)

if(v[i]<min)

min=v[i];

if(v[i]>max)

max=v[i];

cout<<min<<" "<<max;

primul, ultimul, al doilea, penultimul,...

int n,v[1000],i;

cin>>n;

for(i=1;i<=n;i++)

cin>>v[i];

for(i=1;i<=n/2;i++)

cout<<v[i]<<" "<<v[n+1-i]<<" ";

if(n%2!=0) cout<<v[n/2+1];

Să se ordoneze crescător elementele vectorului.

int n,v[1000],i,j,x=0;
cin>>n;
for (i=1;i<=n;i++) cin>>v[i];
for( i = 1; i < n; i++)
for(j = i + 1; j <= n; j++)
if(v[i] > v[j])
{x=v[i];
v[i]=v[j];
v[j]=x;}
for(i = 1; i <= n; i++)
cout << v[i] << ' ';