Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Пузырьковая сортировка массива
//fpc 3.0.0 {Пузырьковая сортировка массива} const n = 30; var a : array [1..n] of integer; var i, j, temp : integer; begin for i := 1 to n do begin a[i] := random(20); write(a[i], ' '); end; writeln; for i := 1 to n - 1 do begin for j := 1 to n - i do if a[j] > a[j+1] then begin temp := a[j]; a[j] := a[j+1]; a[j+1] := temp; end; for j := 1 to n do write(a[j], ' '); writeln; end; for i := 1 to n do write(a[i], ' '); writeln; end.
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
НОД по моему
5 5
Bilangan fibonacci ke-1 sampai ke-n
programme 2
uuu
3e22
Huong11a2@
Fibonasi
practica 2 ejercicio 7
Pascal triangle
Please log in to post a comment.