Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
binary_search-бинарный_поиск
{Двоичный (бинарный поиск)} const n = 4; var a: array[0..n] of integer; low, high, mid, d: integer; i: integer; begin for i := 0 to n do begin a[i] := 2*i+1; write (a[i], ' ') end; writeln; readln(d); low := 0; high := n; while low <= high do begin mid := (high + low) div 2; if a[mid] = d then begin writeln(mid); low := high; end else if a[mid] > d then high := mid-1 else low := mid+1 end; writeln (low, ' ', high) end.
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
SmallQuest
Луноход-4
05 ariketa
Calcular digitos de un numero (hasta 4 digitos)
practica 9 ejercicio 1
LETICIA VIEIRA TEIXEIRA 600618795
Primo1
Решето Эратосфена
Calculatrice 1.0
formato_real
Please log in to post a comment.