Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
444555666
const n = 30; var i, j, k, temp: integer; a: array[1..n] of integer; //= (5, 5, 5, 4, 5, 5, 4, 4, 4, 5 ); begin randomize; for i := 1 to n do begin a[i] := 4 + random(3); write(a[i], ' '); end; writeln; k := 1; j := n; for i := 1 to n do if (a[i] = 6) and (i < j) then begin while (a[j] = 6) and (i < j) do j := j-1; temp := a[i]; a[i] := a[j]; a[j] := temp; j := j - 1; if (a[i] = 4) and (k < i) then // если 6 поменялось с 4 то : begin temp := a[i]; a[i] := a[k]; a[k] := temp; k := k + 1; end; end else if a[i] = 4 then begin temp := a[i]; a[i] := a[k]; a[k] := temp; k := k + 1; end; for i := 1 to n do write(a[i], ' '); writeln; end.
run
|
edit
|
history
|
help
0
BubbleSort (slimst)
Сумма пар чисел кратных и некратных 11 с дельтой
Deskripsi2
LogOp2
Бассейн-8 count
CON YÊU MẸ
Project Euler 21 - Amicable numbers
рекурсия двух функций
janja - naloga 1 - 11.7.2013
janja - naloga 1 - 25.1.2012