Pagini recente » Cod sursa (job #1415432) | Cod sursa (job #2076455) | Profil CristinaElena | Cod sursa (job #1664525) | Cod sursa (job #1951680)
#include<iostream>
#include<fstream>
using namespace std;
int partitie(long long A[50000],int p,int q)
{
int j,i,aux;
i=p-1;
for(j=p;j<=q;j++)
{
if(A[j]<=A[q])
{
i++;
aux=A[j];
A[j]=A[i];
A[i]=aux;
}
}
return i;
}
void quicksort(long long A[50000],int p,int e)
{
int q;
q=partitie(A,p,e);
if(p<e)
{
quicksort(A,p,q-1);
quicksort(A,q+1,e);
}
}
int main()
{
long long A[50000],n,i;
fstream f("algsort.in",ios::in);
f>>n;
for(i=1;i<=n;i++)
{
f>>A[i];
}
f.close();
quicksort(A,1,n);
fstream g("algsort.out",ios::out);
for(i=1;i<=n;i++)
{
g<<A[i]<<" ";
}
}