Pagini recente » Cod sursa (job #1979621) | Cod sursa (job #2076580) | Monitorul de evaluare | Cod sursa (job #1937645) | Cod sursa (job #1982979)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,arr[100];
int main()
{f>>n;
for(int m=0;m<n;m++)
f>>arr[m];
int i, key, j;
for (i = 1; i < n; i++)
{
key = arr[i];
j = i-1;
while (j >= 0 && arr[j] > key)
{
arr[j+1] = arr[j];
j = j-1;
}
arr[j+1] = key;
}
for(int k=0;k<n;k++)
g<<arr[k]<<" ";
}