Pagini recente » Cod sursa (job #3206663) | Cod sursa (job #1822705) | Cod sursa (job #1456771) | Cod sursa (job #1932366) | Cod sursa (job #2515397)
#include <bits/stdc++.h>
#define NMAX 500001
using namespace std;
ifstream f ("algsort.in");
ofstream g ("algsort.out");
FILE *fin = fopen("algsort.in","r");
FILE *fout = fopen("algsort.out","w");
int v[NMAX];
int pivot(int st,int dr)
{
// swap(v[st],v[st + (dr - st)/2]);
int d = 0;
while(st < dr)
{
if(v[st] > v[dr])swap(v[st],v[dr]),d=1-d;
st+=d;
dr-= 1-d;
}
return st;
}
void selectionSort(int st,int dr)
{
int mini;
for(int i = st;i < dr;++i)
{
mini = i;
for(int j=i+1;j<=dr;++j)
if(v[j] < v[mini])mini = j;
swap(v[i],v[mini]);
}
}
void quicksort(int st,int dr)
{
if(st < dr)
{
if(dr - st + 1 <= 100)
selectionSort(st,dr);
else
{
int p = pivot(st,dr);
quicksort(st,p-1);
quicksort(p+1,dr);
}
}
}
void citire()
{
int n;
fscanf(fin,"%d",&n);
for(int i=1;i<=n;++i)
fscanf(fin,"%d",&v[i]);
quicksort(1,n);
for(int i=1;i<=n;++i)
fprintf(fout,"%d ",v[i]);
}
//void citire()
//{
// int n;
// cin >> n;
// for(int i=1;i<=n;++i)cin >> v[i];
// quicksort(1,n);
// for(int i=1;i<=n;++i)cout << v[i] << ' ';
//}
int main()
{
citire();
return 0;
}