代码搜索:binarysearch

找到约 312 项符合「binarysearch」的源代码

代码结果 312
www.eeworm.com/read/174006/9612481

txt 4.6.txt

Listing 4.6 Performing a Binary Search on an Array of Integers using System; using System.Collections; namespace _12_BinarySearch { class Class1 { [STAThread] static void Main(string[] args)
www.eeworm.com/read/210671/15193626

cpp fig04_20.cpp

// Fig. 4.20: fig04_20.cpp // Binary search of an array #include using std::cout; using std::cin; using std::endl; #include using std::setw; int binarySearch( cons
www.eeworm.com/read/249894/12461410

htm cwp1506.htm

Perst.Impl.PersistentMapImpl.binarySearch
www.eeworm.com/read/326711/3470142

c fig06_19.c

/* Fig. 6.19: fig06_19.c Binary search of an array */ #include #define SIZE 15 /* function prototypes */ int binarySearch( const int b[], int searchKey, int low, int high ); void
www.eeworm.com/read/292801/8332047

cpp b-tree.cpp

#include "b-tree.h" #include "StdAfx.h" template int BinarySearch(T a[], int sz, T key) { int low = 1; int high = sz; int mid = 0; T midVal; while(low
www.eeworm.com/read/144420/12796022

java binaryseach.java

class BinarySearch { public static void main(String args[]) { int[] numbers={1,3,4,8,9,12,13,17,18,23,42,49,99,100}; System.out.println(indexOf(numbers,14)); } static int indexOf(int[]
www.eeworm.com/read/179906/5301057

java arraysearching.java

//: c11:ArraySearching.java // Using Arrays.binarySearch(). // From 'Thinking in Java, 3rd ed.' (c) Bruce Eckel 2002 // www.BruceEckel.com. See copyright notice in CopyRight.txt. import com.brucee
www.eeworm.com/read/252364/4409109

java arraysearching.java

//: c11:ArraySearching.java // Using Arrays.binarySearch(). // From 'Thinking in Java, 3rd ed.' (c) Bruce Eckel 2002 // www.BruceEckel.com. See copyright notice in CopyRight.txt. import com.brucee
www.eeworm.com/read/471193/6898969

cpp 1258.cpp

#include #include #include #include #include using namespace std; int p[8][2]={1,0,0,1,-1,-1,1,-1,-1,1,1,1,0,-1,-1,0}; int binarySearch(vector
www.eeworm.com/read/147816/12519396

java arraysorttest.java

/* 在Java中,所有的数组都有一个缺省的属性length,用于获取数组中元素的个数 数组的复制: System.arraycopy(); 数组的排序: Arrays.sort(); 在已排序的数组中查找某个元素: Arrays.binarySearch(); */ import java.util.Arrays; class ArraySortTest { pu