Pagini recente » Cod sursa (job #689336) | Cod sursa (job #1051013) | Cod sursa (job #458188) | Cod sursa (job #401606) | Cod sursa (job #1191501)
using namespace std;
#include <fstream>
//#include <ctime>
//#include <cstdlib>
ifstream fin("algsort.in");
ofstream fout("algsort.out");
char s[5000010];
int poz=0;
int v[500010];
void swap1(int, int) ;
void quick_sort(int, int) ;
int divide(int, int) ;
int get_int() ;
int main()
{
//srand(time(NULL));
int i, n;
fin>>n; fin.get();
fin.getline(s, 5000010);
for(i=0; i<n; ++i) v[i]=get_int();
/*for(i=0; i<n/2; ++i)
{
a=rand()%n; b=rand()%n;
swap1(a, b);
}*/
quick_sort(0, n-1);
for(i=0; i<n; ++i) fout<<v[i]<<' ';
return 0;
}
void swap1(int a, int b)
{
int aux=v[a];
v[a]=v[b];
v[b]=aux;
}
void quick_sort(int p, int u)
{
int m=divide(p, u);
if(p<m-1) quick_sort(p, m-1);
if(m+1<u) quick_sort(m+1, u);
}
int divide(int st, int dr)
{
//int random = (rand())%((dr-st+1)) + st;
int random = (st+dr)/2;
swap1(random, st);
int x=v[st];
while(st<dr)
{
while(st<dr && v[dr]>=x) --dr;
v[st]=v[dr];
while(st<dr && v[st]<=x) ++st;
v[dr]=v[st];
}
v[st]=x;
return st;
}
int get_int()
{
int x=0;
while(s[poz]>='0' && s[poz]<='9' && s[poz]!='\0')
x = x*10 + s[poz]-'0', ++poz;
++poz;
return x;
}