Pagini recente » Cod sursa (job #2764850) | Cod sursa (job #1632585) | Cod sursa (job #3126094) | Cod sursa (job #2386) | Cod sursa (job #2272237)
#include <iostream>//Tema laborator
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,v[500005];
void interclaseaza(int st,int dr,int m)
{
int i,j,k,a[500005];
i=st;
j=m+1;
k=0;
while(i<=m && j<=dr)
{
if(v[i]<v[j])
{
k++;
a[k]=v[i];
i++;
}
else
{
k++;
a[k]=v[j];
j++;
}
}
while(i<=m)
{
k++;
a[k]=v[i];
i++;
}
while(j<=dr)
{
k++;
a[k]=v[j];
j++;
}
k=0;
for(i=st;i<=dr;i++)
{
k++;
v[i]=a[k];
}
}
void MergeSort(int st,int dr)
{
if(st<dr)
{
int m=(st+dr)/2;
MergeSort(st,m);
MergeSort(m+1,dr);
interclaseaza(st,dr,m);
}
}
int main()
{
int i;
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
MergeSort(1,n);
for(i=1;i<=n;i++)
g<<v[i]<<" ";
return 0;
}