Pagini recente » Cod sursa (job #2824387) | Cod sursa (job #2304155) | Cod sursa (job #1803315)
#include<iostream>
#include<fstream>
using namespace std;
void insertion(int a[], int n);
int main(){
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int a[500000],n,i;
fin>>n;
for(i=1;i<=n;i++){
fin>>a[i];
}
insertion(a,n);
for(i=1;i<=n;i++){
fout<<a[i]<<" ";
}
}
void insertion(int a[], int n){
int i,j,aux;
for(i=1;i<n;i++){
for(j=i+1;j<=n;j++){
if(a[i] > a[j]){
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
}
}
}