Cod sursa(job #1445639)
Utilizator | Alex Anastasiu AlexAnastasiu | Data | 30 mai 2015 16:49:05 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
void qsort(int s,int d)
{ int v[100];
int m=v[(s+d)/2];
int i=s,j=d;
while (i<=j)
{
while(v[i]<m)
i++;
while(v[j]>m)
j--;
if(i<=j)
{
swap (v[i],v[j]);
i++;
j--;
}
}
if(s<j)
qsort(s,j);
if(i<d)
qsort(i,d);
}
int main()
{ int i,n;
in>>n;
int v[100];
for(i=0;i<n;i++)
{
in>>v[i];
}
qsort(0,n-1);
for(i=0;i<n;i++)
{
out<<v[i]<<" ";
}
return 0;
}