二分查找

type
  PStringArray = array of String;

// before you use the method,
// the objects you will search have to be sort ascending
function BinarySearch(Strs: PStringArray; Count: Integer;
            const str: String): Integer;
var
  Left, Right, Middle: Integer;
  ResultValue: Integer;
begin
  Left := 0;
  Right := pred(Count);
  while (Left <= Right) do
  begin
    Middle := (Left + Right) div 2;
    ResultValue := CompareText(Strs[Middle], str);
    if (ResultValue = 0) then
    begin
      Result := Middle;
      Exit;
    end
    else if (ResultValue < 0)then
      Left := Middle + 1
    else
      Right := Middle - 1;
  end;
  Result := -1;
end;

procedure TForm1.Button1Click(Sender: TObject);
var
  str: String;
  value: Integer;
  i: Integer;
  PStringArr: PStringArray;
begin
  str := Edit1.Text;
  SetLength(PStringArr, ListBox1.Items.Count);
  for i := 0 to ListBox1.Items.Count - 1 do
  begin
    PStringArr[i] := ListBox1.Items[i];
  end;
  //value := SequenSearch(PStringArr, ListBox1.Items.Count, str);
  value := BinarySearch(PStringArr, ListBox1.Items.Count, str);
  if value <> -1 then
    ShowMessage('Congregate you! You find it')
  else
    ShowMessage('Sorry, you don''t find it!');
end;

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值