// Bubble Sort - Sortarea unui tablou unidimensional
#include<iostream.h>
int v[25];
int i, n, ok, aux;
void main()
{
cout<<"n=";
cin>>n;
for(i=1;i<=n;i++)
{
cout<<"v["<<i<<"]=";
cin>>v[i];
}
for(i=1;i<=n;i++)
cout<<v[i]<<" ";
//Sortarea crescatoare
do
{
ok=1;
for(i=1;i<=n-1;i++)
if(v[i]>v[i+1])
{
//Interschimbare
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=0;
}
}while(ok!=1);
cout<<endl;
for(i=1;i<=n;i++)
cout<<v[i]<<" ";
}