代码搜索：Binary_Search
找到约 214 项符合「Binary_Search」的源代码
代码结果 214
www.eeworm.com/read/376251/9322544
txt c程序.txt
function Binary_Search(L,a,b,x);
begin
if a>b then return(-1)
else begin
m:=(a+b) div 2;
if x=L[m] then return(m)
www.eeworm.com/read/169399/7564606
c
function Binary_Search(L,a,b,x);
begin
if a>b then return(-1)
else begin
m:=(a+b) div 2;
if x=L[m] then return(m)
www.eeworm.com/read/179140/6797428
c
function Binary_Search(L,a,b,x);
begin
if a>b then return(-1)
else begin
m:=(a+b) div 2;
if x=L[m] then return(m)
www.eeworm.com/read/376037/9335258
f90 bsearch.f90
!
! 折半查找法范例
! By Perng 1997/8/31
program BINARY_SEARCH_DEMO
implicit none
integer, parameter :: N=10 ! 类型的大小
integer :: A(N)=(/2,5,7,9,10,11,13,17,21,23/)
integer KEY
integer LO
www.eeworm.com/read/354505/10348963
h binary-search-2.h
inline int BINARY_SEARCH(int* A,int begin,int end,int v)
{
if(begin A[mid])
return BINARY_SEARCH(A,mid+1,
www.eeworm.com/read/354504/10348993
h binary-search-2.h
inline int BINARY_SEARCH(int* A,int begin,int end,int v)
{
if(begin A[mid])
return BINARY_SEARCH(A,mid+1,
www.eeworm.com/read/279576/10413098
m binary_search.m
function Binary_Search(L,a,b,x)%c语言
begin
if a>b then return(-1)
else begin
m:=(a+b) div 2;
if x=L[m] then return(m)
www.eeworm.com/read/416714/11016929
cpp b_search.cpp
#include "stlexam.h"
#pragma hdrstop
/**************************************************************************
*
* b_search.cpp - Example program of binary search.
* See Clas
www.eeworm.com/read/438904/7724892
m binary_search.m
function Binary_Search(L,a,b,x)%c语言
begin
if a>b then return(-1)
else begin
m:=(a+b) div 2;
if x=L[m] then return(m)
www.eeworm.com/read/295984/8130478
m binary_search.m
function Binary_Search(L,a,b,x)%c语言
begin
if a>b then return(-1)
else begin
m:=(a+b) div 2;
if x=L[m] then return(m)