Cod sursa(job #1505591)
Utilizator | Data | 19 octombrie 2015 14:47:34 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int main(){
long A[500000];
int n;
ifstream f("algsort.in");
while(!f.eof()){
f>>n;
for(int i=0;i<n;i++)
f>>A[i];
}
f.close();
for(int i=1;i<n;i++){
int x=A[i];
int j=i-1;
while(A[j]>x && j>-1){
A[j+1]=A[j];
j--;
}
A[j+1]=x;
}
ofstream g("algsort.out");
for(int i=0;i<n;i++)
g<<A[i]<<" ";
g.close();
}