TimxAG

Untitled

Nov 12th, 2016
46
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.74 KB | None | 0 0
  1. const n=30;
  2. var
  3. i,y,d1,d2,uk:integer;a:array[0..n] of integer;
  4. begin
  5. read(y);d1:=0;d2:=n;
  6. for i:=1 to n do
  7. read(a[i]);
  8. uk:=n div 2;
  9. while (a[uk]<>y) do
  10. begin
  11. if (a[uk]<y) and (a[uk+1]>y) then begin
  12. write('Not found');exit;
  13. end;
  14. if (a[uk]>y) and (a[uk-1]<y) then begin
  15. write('Not found');exit;
  16. end;
  17. if (a[uk]<y) then begin
  18. d1:=uk;uk:=d2-((d2-d1) div 2);
  19. end;
  20. if (a[uk]>y) then begin
  21. d2:=uk;uk:=d1+((d2-d1) div 2);
  22. end;
  23. end;
  24. write(uk);
  25. end.
Add Comment
Please, Sign In to add comment