VECTORI(CITIRE SI PB)

V[1000]-vector
V[i]-element
I-pozitia elementului in vector

Int n,i,v[1000],k=0;
Cin>>n;
For(i=1;i<=n;i++)
Cin>>v[i];
For(i=1;i<=n;i++)
If(v[i]%2==1)k++;
Cout<<k;

Int n,i,v[1000],min,imin,max,imax;
Cin>>n;
Max=0;
Min=100000001;
For(i=1;i<=n;i++)
Cin>>v[i];
For(i=1;i<=n;i++)
{
If(v[i]>mx)
{mx=v[i];
Imx=i;}
If(v[i]<mn)
{mn=v[i];
Imn=i;}
}
Cout<<mn<<” “ <<imn<< “ “ <<mx << “
“ <<imx;
Sortarea
Rearanjarea elementelor unui vector in
ordine crescatoare sau descrescatoare.

V[1],v[2],v[3],….,v[n]
V[1]:v[2],v[3],…,v[n];
V[2]:v[3];v[4],…,v[n];
……….
V[n-1]:v[n];

Int n,v[1000],i,j;
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]) swap(v[i],v[j])
For(i=1;i<=n;i++)
Cout<<v[i]<< “ “;

Ex.
N=5;
25,10,6,2,98;
25:10,6,2,98
2,25,10,6,98
……
2,6,10,25,98

Sau

Int n,v[1000],i,j,aux;
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])
{aux=v[i];
V[i]=v[j];
V[j]=aux;}
For(i=1;i<=n;i++)
Cout<<v[i]<< “ “;