Cod sursa(job #1011584)
| Utilizator | Data | 16 octombrie 2013 23:12:27 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
unsigned v[500000];
void merges(unsigned p,unsigned max,unsigned k[]);
int main(){unsigned n;
ifstream f("algsort.in"); f>>n;
for(unsigned i=0;i<n;i++) f>>v[i];
f.close();
unsigned aux,j;
for(unsigned i=0;i<n;i++){
aux=v[i];
j=i-1;
while(j>=0 && aux<v[j]){
v[j+1]=v[j];
j--;}
v[j+1]=aux;
}
ofstream g("algsort.out");
for(unsigned i=0;i<n;i++)
g<<v[i]<<" ";
g.close();
return 0;}
