BUBBLE SORT

#include<iostream> SELECT SORT

using namespace std; #include <iostream>
int n,a[100],i,j,k,maxim=-9999,minim=9999; using namespace std;
int main() int i,j;
{ int main()
int v[100],i,n,gasit,aux;
{
cin>>n;
int v[100];
for(i=1; i<=n; i++)
{ int n, m, k = 0;
cout<<"v["<<i<<"]="; cin>>n;
cin>>v[i]; for(i = 1; i <=n; i++)
} cin >> v[i];
do for(i = 0; i <=n-1; i++)
{ for(j = i+1; j <=n; j++)
gasit=0; if(v[i]<v[j])
for(i=1; i<=n; i++) swap(v[j],v[i]);
if(v[i]>v[i+1])
{
for(i = 1; i <=n; i++)
aux=v[i];
cout<<v[i]<< " ";
v[i]=v[i+1];
v[i+1]=aux; return 0;
gasit=1; }
}
}
while(gasit==1);
for(i=1; i<=n; i++)
cout<<v[i]<<" ";
}
 else C[k] = A[i];
if(v[m]<x) k++;
i++;
Cautarea i=m+1;
else }
else
binara }
s=m-1;
{
#include <iostream> C[k] = B[j];
if(i>s) k++;
using namespace std;
cout<<"Elementulcautat j++;
int n,v[1001],i,s,m,x;
nu se afla in vector"; }
int main()
return 0; }
{
} if(i <= n)
cin>>n; {
for(i=1;i<=n;i++) for(int p = i; p < n; p++)
{ INTERCLASAREA
#include <iostream> {
using namespace std; C[k] = A[p];
cout<<"v["<<i<<"]=";cin>>v[ int main() k++;
i]; { }
} int A[100], B[100], C[200]; }
cin>>x; int n, m, k = 0; if(j <= m)
i=1;s=n; cin>>n; {
for(int i = 0; i < n; i++) for(int p = j; p < m; p++)
while(i<=s)
cin >> A[i]; {
{ C[k] = B[p];
m=(i+s)/2; cin >> m;
for(int i = 0; i < m; i++) k++;
if(x==v[m]) }
cin >> B[i];
{ }
int i = 0, j = 0;
cout<<x<<" se afla pe while(i < n && j < m) for(int p = 0; p < k; p++)
pozitia "<<m; { cout << C[p] << " ";
break; if(A[i] < B[j]) return 0;
} { }
Stergerea unui element dintr- Inserarea unui element intr-un
un vector vector
#include <iostream> #include <iostream>
using namespace std; using namespace std;
int n,i,k,a,x[100]; int n,i,k,a,x[100];
int main() int main()
{ {
cout<<"n="; cout<<"n=";
cin>>n; cin>>n;
for(i=1;i<=n;i++) for(i=1;i<=n;i++)
{ {
cout<<"x["<<i<<"]=";cin>>x[i]; cout<<"x["<<i<<"]=";cin>>x[i];
} }
cout<<"k="; cout<<"k=";
cin>>k; cin>>k;
if(k>n) cout<<"a=";
cout<<"pozitie depasita"; cin>>a;
else if(k>n)
{ cout<<"pozitie depasita";
for(i=k;i<=n;i++) else
x[i]=x[i+1]; {
n--; n++;
for(i=1;i<=n;i++) for(i=n;i>k;i--)
cout<<x[i]<<" "; x[i]=x[i-1];
} x[k]=a;
return 0; for(i=1;i<=n;i++)
} cout<<x[i]<<" ";
}
return 0;
}