您要查找的是不是：
- This is a study on binary search procedures, are interested can download the hack is what I would like these. 这是一个关于二分查找的程序;有兴趣的可以下载砍一下我想就是这些了.
- binary search procedure 对分检索程序
- For a value, using a binary search algorithm. 使用二进制搜索算法在一维的排序。
- Search procedure is from other sites to download. 搜索程序,是从其他网站下载来的。
- Introduction, algorithm, ADT, space and time complexity, binary search, etc. 课程介绍；算法概念；数据抽象；性能分析。
- Binary Search Performing a binary search requires that the elements in the array be sorted. 二进制搜索执行二进制搜索要求数组中的元素已经排序。
- Simple Binary Tree Class - Binary Search Trees are useful for finding items in a list that changes infrequently. 二叉搜索树在查找经常变化的列表时是很非常有用的。
- Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation. 本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
- Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem. 用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。
- A linear search through a small array can be faster than a binary search through a data structure with a lot of pointers that causes page faults or cache misses. 如果二进制搜索通过的数据结构具有许多导致页错误或缓存未命中的指针,则通过小数组的线性搜索可以比二进制搜索快。
- By Kruskal (Kruskal) algorithm ideas, the preparation of a minimum spanning tree of a complete search procedure. (译)：由克鲁斯卡尔（秩）算法的思想，编制一个最小生成树一个完整的搜索程序。
- An effective method of searching an ordered list of entries is the so-called binary search or logarithmic search method. 查几个登记项的有序表的一种有效方法就是所谓的折半查找或称对数查找。
- The mm-conflicts heuristic repair local search procedure will ensure GENET convergence to some states, which could be solutions or local minimum. 它采用的最小冲突启发式修补过程能保证GENET收敛到某些状态，这些状态要么是解，要么是局部极小点。
- We develop a new genetic algorithm hybridized with an innovative local search procedure (bottleneck shifting) for the fJSP. 针对柔性作业车间调度问题，提出了带局域搜索（瓶颈移动法）的混合遗传算法。
- Searches a one-dimensional sorted Array for a value, using a binary search algorithm. 使用二进制搜索算法在一维的排序Array中搜索值。
- This paper presents a new binary search algorithm which makes use of bit message to delimit the searching scope. 摘要根据数据在内存中的存储形式，提出了一种直接利用二进制信息确定待查找数据查找范围的新的二分查找算法。
- Using the quantum parallel process and quantum permutation orations, the circuit implementation of quantum binary searching algorithm is presented. 利用量子并行处理和量子置换操作，给出了量子二分检索算法的线路实现。
- We employan approximated linear search procedure based on the Fletcher exact penalty functionand the use of approximated derivetives of the multiplier function that avoids the needto evaluate the second order derivatives of the problem functions . 并利用Fletcher精确罚函数的近似函数作为线性搜索函数，以避免计算二阶导数。
- By using pyramid structure of the code?book and Cauchy?Schwarz inequality, a condition of removing unnecessary matching operations from the search procedure was derived, then the fast search arithmetic is proposed based on this removing condition. 利用码书的拓扑结构和柯西 施瓦兹不等式的性质推导出了消除不必要匹配操作的条件,并根据这个条件提出了快速搜索算法。
- Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax. 也许同样重要的是基本的算法，如二进制搜索，图形搜索算法，排序算法，并基于树的极小搜索。
