Cod sursa(job #913369)
Utilizator | Data | 13 martie 2013 13:17:56 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int n;
f >> n;
int a[n];
for (int i=0; i<n; i++)
{
f >> a[i];
}
for (int i=1; i<n; i++)
{
if (a[i]<a[i-1])
{
int c=a[i];
a[i]=a[i-1];
a[i-1]=c;
i=1;
}
}
for (int i=0; i<n; i++)
{
g << a[i] << " ";
}
}