Cod sursa(job #796721)
Utilizator | Data | 12 octombrie 2012 11:49:43 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f ("algsort.in");
ofstream g ("algsort.out");
unsigned long n,c;
bool a=1;
f>>n;
unsigned long b[n];
for(int i=0;i<n;i++)
{
f>>b[i];
}
while(a==1)
{
a=0;
for(int f=1;f<n;f++)
{
if(b[f-1]>b[f])
{
c=b[f-1];
b[f-1]=b[f];
b[f]=c;
a=1;
}
}
}
for(int i=0;i<n;i++)
g<<" "<<b[i];
}