#include < iostream.h >
#include < math.h >
int main()
{int a[50],n,i,min,max,p1,p2,ok,aux;
cout< <"n=";cin> >n;
for(i=1;i<=n;i++)
{cout< <"a["< < <"]=";
cin>>a[i];}
min=a[i];
max=a[i];
for(i=1;i<=n;i++)
{if(a[i]
{min=a[i];
p1=i;}
if(a[i]>max)
{max=a[i];
p2=i;}
if(p1>p2)
{aux=p1;
p1=p2;
p2=aux;}
}
do
{ok=0;
for(i=p1;i<=p2-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;
}
marți, 12 octombrie 2010
luni, 11 octombrie 2010
prob cu min
/*se citeste un vector cu n nr intregi disticte.Sa se determine pozitia pe care se afla cea mai mica val din vector si de
la ea in colo sa se ordoneze crescator vec folosind met bulelor*/
#include
#include
int main()
{int a[50],i,n,ok,min,aux,p;
cout < < "n=";cin > > n;
for(i=1;i<=n;i++)
{cout < <"a["<cin > > a[i];}
min = a [ 1 ] ;
for ( i = 1 ; i < =n;i++)
if(a[i] {min=a[i];
p=i;}
do
{ok=0;
for(i=p;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 < < a[ i ] < < " ";
return 0;
}
la ea in colo sa se ordoneze crescator vec folosind met bulelor*/
#include
#include
int main()
{int a[50],i,n,ok,min,aux,p;
cout < < "n=";cin > > n;
for(i=1;i<=n;i++)
{cout < <"a["<cin > > a[i];}
min = a [ 1 ] ;
for ( i = 1 ; i < =n;i++)
if(a[i]
p=i;}
do
{ok=0;
for(i=p;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 < < a[ i ] < < " ";
return 0;
}
marți, 5 octombrie 2010
05.10
/*inter clasarea a 2 vectori
se citesc 2 vec ordon cresc sa se formeze al 3 vec ordon cresc*/
#include< iostream.h >
#include< conio.h >
int main()
cout<< "n=";cin>> n;
for(i=1;i<=n;i++)
{cout<< "a[" << i << "]=";
cin>> a[i];}
cout<<"m=";cin>>m;
for(j=1;j<=n;j++)
{cout<< "b[" << i << "]=";
cin>>b[j];}
while(i<=n&&j<=m)
{if(a[i] {c[k]=a[i];
i++;k++;}
else
if(a[i]>b[j])
{c[k]=b[j];
j++;k++;}
if(i>n)
for(i=j;j<=m;i++)
{c=[k]=b[i];
k++;
else
if(j>m)
for(j=1;j<=n;j++)
{c[k]=a[j];
k++;
for(i=1;i<=n;i++)
cout i
r
se citesc 2 vec ordon cresc sa se formeze al 3 vec ordon cresc*/
#include< iostream.h >
#include< conio.h >
int main()
cout<< "n=";cin>> n;
for(i=1;i<=n;i++)
{cout<< "a[" << i << "]=";
cin>> a[i];}
cout<<"m=";cin>>m;
for(j=1;j<=n;j++)
{cout<< "b[" << i << "]=";
cin>>b[j];}
while(i<=n&&j<=m)
{if(a[i] {c[k]=a[i];
i++;k++;}
else
if(a[i]>b[j])
{c[k]=b[j];
j++;k++;}
if(i>n)
for(i=j;j<=m;i++)
{c=[k]=b[i];
k++;
else
if(j>m)
for(j=1;j<=n;j++)
{c[k]=a[j];
k++;
for(i=1;i<=n;i++)
cout i
r
duminică, 3 octombrie 2010
clasa X
1. Fie secventa a[1] < a[2] < ... < a[j-1] . Inserarea elementului a[j] in aceasta secventa consta in compararea lui a[j] cu a[j-1] , a[j-2]... pana cand se ajunge la a[i] < a[j] si se insereaza a[j] dupa a[i] ( in prealabil elementele a[j-1] , a[j-2] ... a[i+1] au fost deplasate spre dreapta cu o pozitie ) .
Rezolvare :
#include< iostream.h >
#include< conio.h >
int main()
{int n,x,a[10],i,j;
cout<< "n=";cin>> n;
for(i=1;i<=n;i++)
{cout<< "a[" << i << "]=";
cin>> a[i];}
{for(j=1;j<=n;j++)
x=a[j];
i=j-1;
while(i > =1 && x < a[i])
{a[i+1]=a[i];
i--;
}
a[i+1]=x;}
cout<< a[i] << " ";
}
2. Algoritmul de sortare prin metoda bulelor ( bubblesort ) . Se parcurge vectorul operand interschimbari atat timp cat ai exista o pereche a[i], a[i+1] .
Se citeste un vectorcu n componente intregi . Sa se sorteze crescator vectorul si sa se afiseze dupa sortare .
Rezolvare :
#include< iostream.h >
int main()
{int n,i,ok,a[100],aux;
cout<< "n="; cin>> n;
for(i=1;i < =n;i++)
{cout<< "a[" << i << "]=";
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 << a[i] << " ";
}
3. Algoritmul de sortare prin selectie directa .
Rezolvare :
#include< iostream.h >
int main()
{int n,i,ok,a[100],aux;
cout<< "n="; cin>> n;
for(i=1;i < =n;i++)
{cout<< "a[" << i << "]=";
cin >> a[i] ; }
for(i=1;i < =n-1;i++)
{for(j+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 << a [i] << " ";
4. Selectia pentru cautarea minimului .
Se cauta cel mai mic element din sir si se aduce pe aceeasi pozitie . Se aplica acelasi algoritm pentru subsirul obtinut din sirul initial .
Rezolvare :
#include< iostream.h >
int main()
{int n,i,ok,a[100],aux;
cout << "n="; cin >> n;
for(i=1;i < =n;i++)
{cout<< "a[" << i << "]=";
cin >> a[i] ; }
{for(i=1;i < =n-1;i++)
min=1;
for(j=i+1;j < =n;j++)
{if(a[min] > a[j])
min=j;}
}
aux=a[min];
a[min]=a[i];
a[i]=aux;
}
cout << a[i] << " ";
}
Rezolvare :
#include< iostream.h >
#include< conio.h >
int main()
{int n,x,a[10],i,j;
cout<< "n=";cin>> n;
for(i=1;i<=n;i++)
{cout<< "a[" << i << "]=";
cin>> a[i];}
{for(j=1;j<=n;j++)
x=a[j];
i=j-1;
while(i > =1 && x < a[i])
{a[i+1]=a[i];
i--;
}
a[i+1]=x;}
cout<< a[i] << " ";
}
2. Algoritmul de sortare prin metoda bulelor ( bubblesort ) . Se parcurge vectorul operand interschimbari atat timp cat ai exista o pereche a[i], a[i+1] .
Se citeste un vectorcu n componente intregi . Sa se sorteze crescator vectorul si sa se afiseze dupa sortare .
Rezolvare :
#include< iostream.h >
int main()
{int n,i,ok,a[100],aux;
cout<< "n="; cin>> n;
for(i=1;i < =n;i++)
{cout<< "a[" << i << "]=";
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 << a[i] << " ";
}
3. Algoritmul de sortare prin selectie directa .
Rezolvare :
#include< iostream.h >
int main()
{int n,i,ok,a[100],aux;
cout<< "n="; cin>> n;
for(i=1;i < =n;i++)
{cout<< "a[" << i << "]=";
cin >> a[i] ; }
for(i=1;i < =n-1;i++)
{for(j+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 << a [i] << " ";
4. Selectia pentru cautarea minimului .
Se cauta cel mai mic element din sir si se aduce pe aceeasi pozitie . Se aplica acelasi algoritm pentru subsirul obtinut din sirul initial .
Rezolvare :
#include< iostream.h >
int main()
{int n,i,ok,a[100],aux;
cout << "n="; cin >> n;
for(i=1;i < =n;i++)
{cout<< "a[" << i << "]=";
cin >> a[i] ; }
{for(i=1;i < =n-1;i++)
min=1;
for(j=i+1;j < =n;j++)
{if(a[min] > a[j])
min=j;}
}
aux=a[min];
a[min]=a[i];
a[i]=aux;
}
cout << a[i] << " ";
}
Abonați-vă la:
Postări (Atom)
