Pagini recente » Cod sursa (job #1626126) | Cod sursa (job #2637050) | Cod sursa (job #3126238) | Monitorul de evaluare | Cod sursa (job #1011584)
#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;}