You are on page 1of 4

vectori

citirea unui vector


cout<<"n= ";
cin>>n;
for (i=1; i<=n; i++)
{
cout<<"v["<<i<<"]=";
cin>>v[i];
}

afisarea unui vector


for (i=1; i<=n; i++)
cout<<v[i]<<" ";
cout<<endl;

interclasarea a doi vectori

k=0;
while (i<=n && j<=m)
if (a[i]<b[j])
{
k++;
c[k]=a[i];
i++;
}
else
{
k++;
c[k]=b[j];
j++;
}
while (i<=n)
{
k++;
c[k]=b[j];
j++;
}
for (i=1; i<=k; i++)
cout<<c[i]<<" ";

sortarea vectorilor
for (i=1; i<=n-1; i++)
for (j=i+1; j<=n; j++)
if (conditie )
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
}

eliminarea mai multor elemente


for (i=1; i<=n; i++)
if (v[i] conditie)
{
for (j=i; j<=n-1; j++)
v[j]=v[j+1];
n--;
i--;
}
eliminarea de pe pozitia k
for (i=k; i<=n-1; i++)
v[i]=v[i+1];
n--;

inserarea pe ultima pozitie


n++;
v[n]=x;

inserarea pe poz k
n++;
for (i=n; i>=k; i--)
v[i]=v[i-1];
v[k]=x;

inserarea dupa fiecare element


for (i=1;i<=n; i++)
{
if (v[i] cond)
{
n++;
for (j=n; j>=i+1; j--)
v[j]=v[j-1];
v[i+1]=x;
}
}

crearea unui vector din alt vector


k=0;
for (i=1; i<=n; i++)
if (cond)
{
k++;
w[k]=v[i];
}
afisarea
for (i=1; i<=k; i++)
cout<<w[i]<<" ";

PERMUTARE CIRCULARA
- la stanga
aux=v[1];
for (i=1; i<=n-1; i++)
v[i]=v[i+1];
v[n]=aux;
- la dreapta
aux=v[n];
for (i=n; i>=1; i--)
v[i]=v[i-1];
v[1]=aux;

MATRICE
citire
int A[100][100],n,m,i,j;
cout<<"n= "; cin>>n;
cout<<"m= "; cin>>m;
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
{
cout<<"A["<<i<<","<<j<<"]=";
cin>>A[i][j];
}
afisare
for (i=1; i<=n; i++)
{
for (for (j=1; j<=m j++)
cout<<A[i][j]<<" ";
cout<<endl;
}

al de eliminare a unei linii


for (j=1; j<=m; j++)
for (i=l; i<=n-1; i++)
A[i][j]=A[i+1][j];
n--;
al de eliminare a unei coloane
for (i=1; i<=n; i++)
for (j=c; j<=m-1; j++)
A[i][j]=A[i][j+1];
m--;

al de inserare a unei linii


n++;
for (j=1; j<=m; j++)
{
for (i=n; i>=k; i--)
A[i][j]=A[i-1][j];
A[k][j]=x;
}

MATRICE PATRATICA
1.parcurgerea matricei pe diagonala principala
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i==j)
<prelucrari>
2. parcurgerea el deaspura diagonalei princ
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i<j)
<...>
3. parcurgerea el sub diagonala princ
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i>j)
<...>
4.parcurgerea matricei in raport cu diagonala secundara
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i+j==n+1)
<...>
5. deasupra diagonalei secundare
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i+j<n+1)
<...>
6. sub diagonala secundara
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i+j>n+1)
<...>

You might also like