Pagini recente » Cod sursa (job #548675) | Cod sursa (job #2214508) | Cod sursa (job #183656) | Cod sursa (job #1778693) | Cod sursa (job #1021878)
#include<iostream>
#include<fstream>
ifstream f("algstruct.in");
ofstream g("algstruct.out");
void quicksort(int v[100],int stanga,int dreapta)
{
int i,j,mij,aux;
i=stanga;
j=dreapta;
mij=v[(i+j)/2];
while(i<=j)
{
while(v[i]<mij)i++;
while(v[j]>mij)j--;
if(i<=j)
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
i++;
j--;
}
}
if(j>stanga)quicksort(v,stanga,j);
if(i<dreapta)quicksort(v,i,dreapta);
}
int main()
{
int n,v[100],st,dr,i;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
st=1;
dr=n;
quicksort(v,st,dr);
for(i=1;i<=n;i++)
g<<v[i]<<" ";
f.close();
g.close();
return 0;
}