您要查找的是不是：
- For a value, using a binary search algorithm. 使用二進(jìn)制搜索算法在一維的排序。
- 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. 二進(jìn)制搜索執行二進(jìn)制搜索要求數組中的元素已經(jīng)排序。
- Simple Binary Tree Class - Binary Search Trees are useful for finding items in a list that changes infrequently. 二叉搜索樹(shù)在查找經(jīng)常變化的列表時(shí)是很非常有用的。
- This is a study on binary search procedures, are interested can download the hack is what I would like these. 這是一個(gè)關(guān)于二分查找的程序;有興趣的可以下載砍一下我想就是這些了.
- Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation. 本文主要研究隨機遞歸樹(shù)和隨機二叉搜索樹(shù)上與分支和子樹(shù)相關(guān)的極限定理。
- 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. 用一個(gè)二叉搜索樹(shù)或者將串切分成長(cháng)度的平方根那么長(cháng)的小段都可以解決這個(gè)問(wèn)題。
- 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. 如果二進(jìn)制搜索通過(guò)的數據結構具有許多導致頁(yè)錯誤或緩存未命中的指針,則通過(guò)小數組的線(xiàn)性搜索可以比二進(jìn)制搜索快。
- An effective method of searching an ordered list of entries is the so-called binary search or logarithmic search method. 查幾個(gè)登記項的有序表的一種有效方法就是所謂的折半查找或稱(chēng)對數查找。
- Searches a one-dimensional sorted Array for a value, using a binary search algorithm. 使用二進(jìn)制搜索算法在一維的排序Array中搜索值。
- This paper presents a new binary search algorithm which makes use of bit message to delimit the searching scope. 摘要根據數據在內存中的存儲形式，提出了一種直接利用二進(jìn)制信息確定待查找數據查找范圍的新的二分查找算法。
- Using the quantum parallel process and quantum permutation orations, the circuit implementation of quantum binary searching algorithm is presented. 利用量子并行處理和量子置換操作，給出了量子二分檢索算法的線(xiàn)路實(shí)現。
- Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax. 也許同樣重要的是基本的算法，如二進(jìn)制搜索，圖形搜索算法，排序算法，并基于樹(shù)的極小搜索。
- On the Subtrees of Random Binary Search Trees 隨機二叉搜索樹(shù)的子樹(shù)
- A BINARY SEARCH BASED ON RANGE RESTRAINT 一種基于區間約束的折半查找算法
- A Binary Search Aigorithm Based on Bit 基于位的二分查找算法
- binary search method -dichotomizing search 對分檢索, 對半檢索法
- multidimensional binary search tree 多維二叉檢索樹(shù), 多維二進(jìn)制搜索樹(shù)
- A byte composed of eight binary elements. 一個(gè)由8個(gè)二進(jìn)制數位組成的字節。
- A byte composed of two binary elements. 一種由兩個(gè)二進(jìn)制位組成的字節。同two－bitbyte。
