*Se citeste un vector cu n nr int.
Sa se ordoneze crescator val imp din vector iar cele cresc ramana pe loc.*/
#include< iostream.h >
#include< math.h >
int main()
{int a[50],i,j,n,aux;
cout< <"n=";cin> >n;
for(i=1;i<=n;i++)
{cout< <"a["< return 0;
}

27.09.2010 Ordonarea Vectorilor(4) Insertie

#include< iostream.h >
#include< math.h >
int main()
{int a[30],n,i,j,x;
cout< <"n=";cin> >n;
for(i=1;i<=n;i++)
{cout<<"a["< cin>>a[i];
}
for(j=1;j<=n;j++)
{x=a[j];
i=j-1;
while((i>=1)&&(x {
a[i+1]=a[i];
i=i-1;
}
a[i+1]=x;
}
for(i=1;i<=n;i++)
cout< return 0;
}

27.09.2010 Ordonarea Vectorilor(4) Insertie

21.09.2010 Ordonarea Vectorilor(3)

#include< iostream.h >
#include< math.h >
int main()
{int n,i,j,a[30],min,aux;
cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
{cout<<"a["<cin>>a[i];
}
for(i=1;i<=n-1;i++)
{min=i;
for(j=i+1;j<=n;j++)
{if(a[min]>a[j])
min=j;
}
aux=a[min];
a[min]=a[i];
a[i]=aux;
}
for(i=1;i<=n;i++)
cout<return 0;
}

21.09.2010 Ordonarea Vectorilor(2)

#include< iostream.h >
#include< math.h >
int main()
{int n,i,j,a[30],aux;
cout< <"n=";cin> >n;
for(i=1;i<=n;i++)
{cout< <"a["< return 0;
}

21.09.2010 Ordonarea Vectorilor

/*Se citeste un vector cu n valori int .Sa se sorteze cresscator vectorul si sa se
afiseze dupa sortare.*/
#include< iostream.h >
#include< math.h >
int main()
{int n,i,a[50],aux,ok;
cout< <"n=";cin> >n;
for(i=1;i<=n;i++)
{cout< <"a["< return 0;
}

20.09.2010

/*Se citeste un vector cu n compaonente.Sa se determine componentul min si cel max din vector si
sa se afiseze pozitia in care apare primul element minim si pozitia ultima pe care apare max.*/
#include < iostream.h >
#include < fstream.h >
int main()
{int a[10],n,i,min,max,p1,p2;
cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
{cout<<"a["<cin>>a[i];
}
max=a[1];
min=a[1];
p1=1;
p2=1;
for(i=1;i<=n;i++)
{if(a[i] {min=a[i];
p1=i;}
if(a[i]>=max)
{max=a[i];
p2=i;}
}
cout<<"max="<cout<<"min="<return 0;
}

14.09.2010

#include
#include
int main()
{int a[25],n,i;
cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
{cout<<"a["<cin>>a[i];
}
for(i=1;i<=n;i++)
if(i%2!=0)
cout<return 0;
}