Cod sursa(job #1232588)
Utilizator | Daniel Amariei daniel.amariei | Data | 23 septembrie 2014 13:37:30 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
void insertion_sort(int A[], int left, int right)
{
for (int i = left + 1; i <= right; ++i)
{
int e = A[i];
int j = i;
while (j > 0 && A[j-1] > A[j])
{
A[j] = A[j-1];
--j;
}
A[j] = e;
}
}
int main()
{
ifstream ifs("algsort.in");
ofstream ofs("algsort.out");
int A[500000], n;
ifs >> n;
for (int i = 0; i < n; ++i)
ifs >> A[i];
insertion_sort(A, 0, n-1);
for (int i = 0; i < n; ++i)
ofs << A[i] << " ";
return 0;
}