Pagini recente » Cod sursa (job #3186786) | Cod sursa (job #2731224) | Cod sursa (job #3125668) | Cod sursa (job #341978) | Cod sursa (job #330808)
Cod sursa(job #330808)
#include "fstream"
std::ifstream in("algsort.in");
std::ofstream out("algsort.out");
void sort(int a[],int st, int m, int dr)
{
int b[100];
int i, j, k;
i = 0; j = st;
while (j <= m)
b[i++] = a[j++];
i = 0; k = st;
while (k < j && j <= dr)
if (b[i] <= a[j])
a[k++] = b[i++];
else
a[k++] = a[j++];
while (k < j)
a[k++] = b[i++];
}
void die(int a[],int st, int dr)
{
if (st < dr )
{
int m = (st+dr)/2;
die(a,st, m);
die(a,m+1, dr);
sort(a,st, m, dr);
}
}
int main()
{
int n,a[100];
in>>n;
int i;
for(i=0;i<n;i++)
in>>a[i];
die(a,0,n);
for(i=0;i<n;i++)
out<<a[i]<<" ";
in.close ();
out.close ();
return 0;
}