Cod sursa(job #266678)
Utilizator | Antal Alin Alin1771 | Data | 25 februarie 2009 22:38:08 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
var
n,k:longint;
x:array[1..10000] of longint;
f,g:text;
begin
assign(f,'algsort.in');reset(f);
assign(g,'algsort.out');rewrite(g);
readln(f,n);
for k:=1 to n do read(f,x[k]);
k:=0;
while k<n do
if x[k]>x[k+1] then begin
x[k]:=x[k]-x[k+1];x[k+1]:=x[k]+x[k+1];x[k]:=x[k+1]-x[k];
if k>1 then k:=k-1;
end else inc(k);
for k:=1 to n do write(g,x[k],' ');
close(f);
close(g);
readln
end.