Cod sursa(job #1446549)
Utilizator | Diaconescu Vlad VladD12 | Data | 2 iunie 2015 10:15:02 |
---|---|---|---|
Problema | Sortare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.74 kb |
#include <fstream>
ifstream in ("sortare.in")
ofstream out ("sortare.out")
using namespace std;
int V[100];
void qsort (int s,int d)
{int i=s;
int j=d;
int m=V[(i+j)/2]
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,i)
if (d>i)
qsort (j,d);
int main()
{int i=s;
for (i=1;i<=m;i++;)
out<< V[i];
out<< m;
for (j=1;j>=d;j++)
out<< V[j];
return 0;
}