Cod sursa(job #1481021)
| Utilizator | Data | 3 septembrie 2015 17:31:05 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
int main()
{
int N;
ifstream in("algsort.in");
ofstream out("algosort.out");
in >> N;
int V[N];
for (int i = 0; i < N; i++) {
in >> V[i];
}
for(int i = 0; i < N - 1; i++)
{
for(int j = 0; j < N - 1; j++)
{
if(V[j] > V[j + 1])
{
swap(V[j], V[j + 1]);
}
}
}
for(int a = 0; a < N; a++)
{
out << V[a] << " ";
}
in.close();
out.close();
return 0;
}
