mirror of
https://github.com/ProgramSnail/Lama.git
synced 2025-12-06 06:48:48 +00:00
29 lines
380 B
Text
29 lines
380 B
Text
|
local n, x, i;
|
||
|
|
|
||
|
|
fun sort (x) {
|
||
|
|
local i, j, y, n;
|
||
|
|
n := x.length;
|
||
|
|
|
||
|
|
if n == 0 then x fi;
|
||
|
|
|
||
|
|
for i := 0, i<n, i := i+1 do
|
||
|
|
for j := i+1, j<n, j := j+1 do
|
||
|
|
if x[j] < x[i] then
|
||
|
|
y := x[i];
|
||
|
|
x[i] := x[j];
|
||
|
|
x[j] := y
|
||
|
|
fi
|
||
|
|
od
|
||
|
|
od;
|
||
|
|
|
||
|
|
x
|
||
|
|
}
|
||
|
|
|
||
|
|
n := read ();
|
||
|
|
x := [10, 9, 8, 7, 6, 5];
|
||
|
|
|
||
|
|
x := sort (x);
|
||
|
|
|
||
|
|
for i:=0, i<x.length, i:=i+1 do
|
||
|
|
write (x[i])
|
||
|
|
od
|