代码搜索：binarysearch
找到约 312 项符合「binarysearch」的源代码
代码结果 312
www.eeworm.com/read/378375/9233766
java fac2_3.java
//本程序取自王晓东编著“算法分析与设计”第 28 页，例
//二分搜索算法
public class Fac2_3{
public static int binarySearch(int[] a,int x,int n)
{
//数组a事先进行排序，找到返回数组下标
int left=0;int right=n-1;
while(left
www.eeworm.com/read/377523/9272858
java arraysearching.java
//: c09:ArraySearching.java
// From 'Thinking in Java, 2nd ed.' by Bruce Eckel
// www.BruceEckel.com. See copyright notice in CopyRight.txt.
// Using Arrays.binarySearch().
import com.bruceeckel.u
www.eeworm.com/read/377354/9279248
cpp p231.cpp
#include "iostream.h"
#include "p228.cpp"
template class OrderedList : public DataList {
public:
OrderedList ( int sz = 10 ) : DataList (sz) { }
virtual
www.eeworm.com/read/373369/9460109
java arraysearching.java
//: arrays/ArraySearching.java
// Using Arrays.binarySearch().
import java.util.*;
import net.mindview.util.*;
import static net.mindview.util.Print.*;
public class ArraySearching {
public s
www.eeworm.com/read/169058/9882774
java arraysearching.java
//: arrays/ArraySearching.java
// Using Arrays.binarySearch().
import java.util.*;
import net.mindview.util.*;
import static net.mindview.util.Print.*;
public class ArraySearching {
public s
www.eeworm.com/read/361936/10027645
java testsearch.java
public class TestSearch {
public static void main(String[] args) {
int a[] = { 1, 3, 6, 8, 9, 10, 12, 18, 20, 34 };
int i = 12;
//System.out.println(search(a, i));
System.out.println(bin
www.eeworm.com/read/358784/10179611
inc bsearch.inc
; Bsearch.inc - prototypes for procedures used in
; the BubbleSort / BinarySearch program.
; Search for an integer in an array of 32-bit signed
; integers.
BinarySearch PROTO,
pArray:PTR DWORD
www.eeworm.com/read/353439/10446812
java ex22.java
// arrays/Ex22.java
// TIJ4 Chapter Arrays, Exercise 22, page 786
// Show that the results of performing a binarySearch() on an
// unsorted array are unpredictable.
import java.util.*;
import net
www.eeworm.com/read/424004/10508060
cpp ex6_4.cpp
//【例6.4】对半查找递归算法，算法作为有序表（ordered list）模板类的成员函数。
#include
using namespace std;
template class Orderedlist{
int maxsize;
int last;
T slist[size];
public:
Ord
www.eeworm.com/read/424004/10508073
h ex6_4.h
template int Orderedlist::Binarysearch
(T & x,const int low,const int high){ // x为定值
int mid=-1;//关键！否则找不到时出错
if (low