function search( key : typekey; var r : dataarray ) : integer;
	var i : integer;

	begin
	i := 1;
	while  ( i<n ) and ( key <> r[i].k ) do i := i+1;
	if r[i].k=key  then search := i    {*** found(r[i]) ***}
			else      search := -1;  {*** notfound(key) ***}
	end;