program pascaltask;
uses crt;
const N=чемунить;
var
a,b,c: integer;
x: array  [1..N] of integer;
begin
writeln('сама исполняемая программа...ну или код, кто как понимает');
end.

Procedure Puzirek; 
Var i, j: Integer; 
y:Integer;
Begin 
For i := 2 to n do 
For j := n downto i do 
If X[j-1] > X[j] then begin y:=X[j-1];
X[j-1]:=X[j];
X[j]:=y
end;
End;

function BSearch (item: DataArray; count:integer;
                             key:DataItem):integer;
     var
       low, high, mid: integer;
       found:boolean;
     begin
       low:=1; high:=count;
       found:=false;         { не найден }
       while (low<=high) and (not found) do
       begin
         mid:=(low+high) div 2;
         if key<item[mid] then high:=mid-1
         else if key>item[mid] then low:=mid+1
         else found:=true;  { найден }
       end;
       if found then BSearch:=mid
       else BSearch:=0;  { не найден }
     end; { конец поиска }

type
    DataItem = char;
    DataArray = array [1..80] of char;

program Puzirek; 
uses crt;
Var i, j: Integer; 
y:Integer;
Begin 
For i := 2 to n do 
For j := n downto i do 
If X[j-1] > X[j] then begin y:=X[j-1];
X[j-1]:=X[j];
X[j]:=y
end;
end.

Цитата(Sardukar @ 28.11.2007 14:33)

type
    DataItem = char;
    DataArray = array [1..N] of char;

program pascaltask;
uses crt;
const N=чемунить;
keyval = значение ключа;
type
    DataItem = integer;
    DataArray = array [1..N] of integer;
var
    i , key, positionOFkey : DataItem ;
    x: DataArray;
function BSearch (item: DataArray; count:integer;
                             key:DataItem):integer;
     var
       low, high, mid: integer;
       found:boolean;
     begin
       low:=1; high:=count;
       found:=false;         { не найден }
       while (low<=high) and (not found) do
       begin
         mid:=(low+high) div 2;
         if key<item[mid] then high:=mid-1
         else if key>item[mid] then low:=mid+1
         else found:=true;  { найден }
       end;
       if found then BSearch:=mid
       else BSearch:=0;  { не найден }
     end; { конец поиска }

begin
   randomize;
   for i := 1 to N do
       DataArray[i] := Random (какое-то число) ;

  key := keyval ;
  positionOFkey := BSearch (x, key);
  
   writeln('ну и обработчик вывода');
end.

program binPoisk;
uses crt;
const N=5;
var
i, p, q, s, b, t, POK, count: integer;
X: array [1..N] of integer;
{=====================================================}
procedure puzirek;
var
i, j, y: integer;
begin
for i:= 2 to n do
for j:= n downto i do
if X[j-1] > X[j] then
begin
y:=X[j-1];
X[j-1]:=X[j];
X[j]:=y
end;
end;
{=====================================================}
procedure BSearch;
     var
       low, high, mid: integer;
       found:boolean;
     begin
       low:=1; high:=count;
       found:=false;
       while (low<=high) and (not found) do
       begin
         mid:=(low+high) div 2;
         if b<X[mid] then high:=mid-1
         else if b>X[mid] then low:=mid+1
         else found:=true;
                end;
       if found then BSearch:=mid                                              {Злостно ругается что тут не : а ; должна быть}
       else BSearch:=0;
     end;
{=====================================================}
begin
clrscr;
writeln('Vvodim ',N,'elementov massiva X');
for i:=1 to N do
read(X[i]);
writeln('Ne sortirovanii massive X');
for i:=1 to N do
write(X[i],' ');
writeln;
puzirek;
writeln('Otsortirovanii massive X');
for i:=1 to N do
write(X[i],' ');
writeln;
writeln('Vvedite iskomii klu4');
read(b);
POK:= BSearch (X, b);
readln;
end.