Pagini recente » Cod sursa (job #984367) | Cod sursa (job #2825114) | Cod sursa (job #2056452) | Cod sursa (job #3219900) | Cod sursa (job #3137001)
#include <iostream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
int arr[],n;
cin>>n;
int n=sizeof( arr )/sizeof( arr[0] );
for(int i=0; i<n; i++)
fin>>arr[i] >> " ";
int temp, j;
for(int dists=n/2; dists>0; dists/=2)
{
//int dist=dists;
for(int i=dists; i<n; ++i)
{
int temp=arr[i];
for(j=i-dists; (j>=0 && arr[j]>temp); j-=dists)
{
arr[j+dists] = arr[j];
}
arr[j+dists] = temp;
}
}
fout<<endl;
for(int i=0; i<n; ++i)
fout<<arr[i]<< " ";
return 0;
}