Pagini recente » Cod sursa (job #276123) | Cod sursa (job #1685023) | Cod sursa (job #666106) | Cod sursa (job #2573981) | Cod sursa (job #881797)
Cod sursa(job #881797)
#include<fstream>
using namespace std;
int v[500000],n;
int selectqs(int v[], int st, int dr){
int i = st, j = dr, di = 0, dj = 1;
while (i < j){
if (v[i] > v[j]){
int aux;
aux = v[i];
v[i]=v[j];
v[j]=aux;
di = !dj;
dj = !di;
}
i = i+di;
j = j-dj;
}
return i;
}
void quicksort(int v[], int start, int stop){
if(start < stop){
int b=selectqs(v,start,stop);
quicksort(v,start,b-1);
quicksort(v,b+1, stop);
}
}
int main()
{
int i;
ifstream in("algsort.in");
ofstream out("algsort.out");
in>>n;
for(i=0;i<n;i++)
in>>v[i];
quicksort(v,0,n-1);
for(i=0;i<n;i++)
out<<v[i]<<" ";
return 0;
}