Cod sursa(job #613456)
| Utilizator | Data | 26 septembrie 2011 16:33:10 | |
|---|---|---|---|
| Problema | Sortare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include<fstream>
using namespace std;
int a[50],n,i;
void quick(int p,int q)
{
int aux,i,j,t=0;
if(p<q)
{
i=p;
j=q;
t=1;
do
{
if(a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
t=1;
}
if(t)
j--;
else
i++;
}while(i!=j);
quick(p,i-1);
quick(i+1,q);
}
}
int main()
{
ifstream f("quick.in");
ofstream g("quick.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
g<<a[i]<<" ";
g<<"\n";
quick(1,n);
for(i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;
}
