Mai intai trebuie sa te autentifici.
Cod sursa(job #631974)
Utilizator | Data | 9 noiembrie 2011 23:11:10 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.01 kb |
#include<fstream>
#define nmax 500005
using namespace std;
int n;
int a[nmax];
void citire()
{
ifstream fin("algsort.in");
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
fin.close();
}
void afisare()
{
ofstream fout("algsort.out");
for(int i=1;i<=n;i++)
fout<<a[i]<<" ";
fout.close();
}
void quick_sort(unsigned int st,unsigned int dr)
{
int aux;
if(st<dr)
{
unsigned int mijl=(st+dr)/2;
unsigned int i,j;
i=st;j=dr;
while(i<=j)
{
while(a[i]<a[mijl]) i++;
while(a[j]>a[mijl]) j--;
if(i<=j)
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
i++;
j--;
}
}
if(st<j)
quick_sort(st,j);
if(dr>i)
quick_sort(i,dr);
}
}
int main()
{
citire();
quick_sort(1,n);
afisare();
return 0;
}