Pagini recente » Cod sursa (job #1129779) | Cod sursa (job #2350100) | Cod sursa (job #2938608) | Cod sursa (job #2534978) | Cod sursa (job #661939)
Cod sursa(job #661939)
#include<fstream>
using namespace std;
int a[500001],n;
ifstream f("algsort.in");
ofstream g("slgsort.out");
void quicksort(int a[500001],int l,int r)
{int aux,min,max,mid;
mid=a[(r-l)/2];
min=l;
max=r;
while(min>max)
{while(a[min]<mid)
min++;
while(a[max]>mid)
max--;
if(min <= max)
{ aux=a[min];
a[min++]=a[max];
a[max--]=aux; }
}
if(l<max)
quicksort(a,l,max);
if(r>min)
quicksort(a,min,r);
}
int main()
{int i;
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
quicksort(a,n,i);
for(i=1;i<=n;i++)
g<<a[i]<<"\n";
f.close();
g.close();
return 0;
}