您要查找的是不是:
- binary search program 二分法检索程序
- For a value, using a binary search algorithm. 使用二进制搜索算法在一维的排序。
- When I do, the search program for windows disappears. 当我看,搜索程序窗口消失。
- 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. 二叉搜索树在查找经常变化的列表时是很非常有用的。
- This is a study on binary search procedures, are interested can download the hack is what I would like these. 这是一个关于二分查找的程序;有兴趣的可以下载砍一下我想就是这些了.
- Welcome to the American Association of Variable Star Observers (AAVSO) Nova Search program. 欢迎访问美国变星协会新星搜索组。
- 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. 如果二进制搜索通过的数据结构具有许多导致页错误或缓存未命中的指针,则通过小数组的线性搜索可以比二进制搜索快。
- An effective method of searching an ordered list of entries is the so-called binary search or logarithmic search method. 查几个登记项的有序表的一种有效方法就是所谓的折半查找或称对数查找。
- 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. 利用量子并行处理和量子置换操作,给出了量子二分检索算法的线路实现。
- Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax. 也许同样重要的是基本的算法,如二进制搜索,图形搜索算法,排序算法,并基于树的极小搜索。
- queue-oriented depth-first search program 面向队列的深度优先搜索程序
- On the Subtrees of Random Binary Search Trees 随机二叉搜索树的子树
- In our database there are a total of 108 compounds of azobenzenes, of which 102 were retrieved from the CSD (Cambridge Structure Database) using searching program and 6 were determined by us. 我们从剑桥结构数据库(The Cambridge Structural Database,简称CSD)运用搜索程序,搜索到102个化合物,加上我们所测定的六个晶体共108个。
- A BINARY SEARCH BASED ON RANGE RESTRAINT 一种基于区间约束的折半查找算法