marți, 21 septembrie 2010

21.09.2010 Ordonare Vectoriala(3)

#include
#include
int main()
{int n,i,j,min,a[30],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 Ordonare Vectoriala(1)

/*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["< < <"]=";
cin> >a[i];
}
do
{ok=0;
for(i=1;i<=n-1;i++)
if(a[i]>a[i+1])
{aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=1;
}
}
while(ok==1);
for(i=1;i<=n;i++)
cout< < <" ";
return 0;
}

21.09.2010 Ordonare Vectoriala(2)

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

21.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="<<<" "<<"Pe pozitia"<<
cout<<"min="<<<" "<<"Pe pozitia"<
return 0;
}