Sortarea prin selectarea minimului(maximului)

#include<iostream>
using namespace std;
int main(){
int a[10],i,j,k,n,min,man;
cout<<"n=";cin>>n;
for(i=0;i<n;i++)
{cout<<"a["<<i<<"]=";
cin>>a[i];}
for(i=0;i<n;i++)
{cout<<a[i]<<" ";}
cout<<endl;
for(i=0;i<n-1;i++)
{min=a[i];
k=i;
for(j=i+1;j<n;j++)
if (a[j]<min)
{min=a[j];
k=j;}
man=a[k];
a[k]=a[i];
a[i]=man;}
for(i=0;i<n;i++)
{cout<<a[i]<<" ";}
}

Sortarea prin interschimbare(Bubblesort)

#include<iostream>
using namespace std;
int main ()
{int a[9],i,n,aux,gasit;
cout<<"n="; cin>>n;
for (i=1;i<=n;i++)
{cout<<"a["<<i<<"]=";
cin>>a[i];}
do{gasit=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;
gasit=1;}}
while(gasit);
for(i=1;i<=n;i++)
cout<<a[i]<<" ";
}

Sortarea prin inserie

#include<iostream>
using namespace std;
int main ( )
{
int i,j,n,aux,a[50];
cout<<" introduceti dimensiunea sirului: "<<endl;cin>>n;
cout<<"Dati elementele sirului:"<<endl;
for(i=0;i<n;i++)
{
cout<<"a["<<i<<"]=";cin>>a[i];
}
for(j=1;j<n;j++)
{ aux=a[j];
i=j-1;
while (aux<a[i] && i>=0)
{ a[i+1]=a[i];
i=i-1;
}
a[i+1]=aux;
}
cout <<"Sirul ordonat este:";
for(i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
}