中英
1
binary search中文是什么意思
- 中文翻譯
- 造句
- 對(duì)半檢索
- 對(duì)分查找
- 對(duì)分檢索
- 對(duì)分搜索，折半查找
- 二分查找
- 二分搜尋法
- 二元搜尋
- 折半查找法
- 折半檢索
- binary adj. 二，雙，復(fù)；【化學(xué)】二元的；【數(shù)學(xué)】二進(jìn)制的。 ...
- search vt. 1.搜查；檢查(身體、衣袋等)；搜索，搜尋；找； ...
- search, binary 二元搜尋
- binary search algorithm 二分法檢索算法
- binary search method 對(duì)半檢索法; 對(duì)分檢栓
- binary search procedure 對(duì)分檢索程序
- binary search program 對(duì)分檢索法; 折半查找程序
- binary search routine 對(duì)分檢索子程序; 折半查找子程序
- binary search tree 對(duì)分查找樹; 對(duì)分檢索樹; 二叉查找樹; 二叉檢索樹; 二叉排序樹; 二叉搜索樹; 二元搜索樹; 二元搜尋樹
- binary search trees 第十二章 二叉查找樹
- binary tree search 二叉樹查找; 二叉樹檢索; 二叉樹搜尋
- binary-tree search 二元樹狀搜尋
- optimal binary search tree 最佳二叉查找樹; 最佳二元搜尋樹
- search binary tree 二元樹狀搜尋
- binary table search data base 資料庫(kù)二元表查尋
- binary table search data-base 數(shù)據(jù)庫(kù)二元表查尋
- data base binary table search 二元表查詢?yōu)橐环N有次序的表
- binary adj. 二，雙，復(fù)；【化學(xué)】二元的；【數(shù)學(xué)】二進(jìn)制的。 n. 二，雙，復(fù)；雙體，復(fù)體；【天文學(xué)】雙[聯(lián)]星【數(shù)學(xué)】二進(jìn)制。
- in search of 為了尋求……; 為了尋找; 尋找,尋求; 尋找；搜尋；查究; 尋找；尋求
- in that search 在那次搜索中
- s search 找姑姑
- search vt. 1.搜查；檢查(身體、衣袋等)；搜索，搜尋；找；尋找。 2.調(diào)查；查究；探求；追求；根究 (into)。 3.(冷風(fēng)等)到處侵入，刺透。 4.【軍事】使(火力)向縱深展開。 search sb. 搜查身體。 search a book 在一本書里查找材料。 search one's memory 竭力回憶。 The shrapnel was searching every cranny. 榴霰彈正在四散開來(lái)。 vi. 1.搜尋，搜查 (for);探求。 2.【計(jì)算機(jī)】覓數(shù)，檢索。 search after [for] 尋找；尋求，追求；探求 (search after health 講究健康；保養(yǎng)。 search a house for papers 在一座房屋里搜查文件)。 search into 調(diào)查；研究；根究。 S- me! 〔美國(guó)〕我不知道。 search out 搜出；查出；探出；找出。 n. 1.搜索；搜尋；尋找。 2.探索；探求 (after for) 調(diào)查；檢查。 in search of 尋找；去找；追求；為了尋求；試圖發(fā)現(xiàn)。 make a search after (去)找；尋求；追求。
- search for 查找; 后接地點(diǎn); 后接?xùn)|西; 檢索關(guān)鍵詞輸入框; 搜，找尋; 搜人,物; 搜索主題; 尋找，搜索; 尋找,搜尋; 尋找，探查；搜查; 尋找,尋求; 尋找；搜查；竭力想；苦想
- search in 檢索對(duì)象; 搜索地點(diǎn)
- search into 調(diào)查
- Add and remove operations are typically expensive since binary search trees require that a tree be balanced
通常需要增加和刪除操作，因?yàn)槎鏄湫枰黄胶狻? - Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently
二叉搜索樹在查找經(jīng)常變化的列表時(shí)是很非常有用的。 - This method performs a binary search ; however , the elements are moved up to fill in the open spot , so this method is an o
此方法執(zhí)行二進(jìn)制搜索，但會(huì)上移元素以填充空白區(qū)域，因此，此方法的運(yùn)算復(fù)雜度為o ( - The split of search space can be described as a virtue binary search tree and the info - search process is similar to the search in the binary tree
在此基礎(chǔ)上，信息的搜索就可描述為二進(jìn)制搜索樹的查找過(guò)程。 - 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è)二叉搜索樹或者將串切分成長(zhǎng)度的平方根那么長(zhǎng)的小段都可以解決這個(gè)問(wèn)題。 - If the search is time - critical , a binary search or hash table lookup is almost always best , but as with sorting , you must keep locality in mind
如果搜索是時(shí)間關(guān)鍵的，二進(jìn)制搜索或者哈希表查找?guī)缀蹩偸亲詈玫模桥c排序一樣，必須記住地址。 - 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ò)的數(shù)據(jù)結(jié)構(gòu)具有許多導(dǎo)致頁(yè)錯(cuò)誤或緩存未命中的指針，則通過(guò)小數(shù)組的線性搜索可以比二進(jìn)制搜索快。 - In the above example , a simple hashmap or binary search tree could have easily solved the problem , but implementing one of these data structures in xsl would be inconvenient and unnecessary
在上面的示例中，如果使用一個(gè)簡(jiǎn)單的散列圖（ hashmap ）或二進(jìn)制搜索樹就可以輕易地解決問(wèn)題，但是用xsl實(shí)現(xiàn)一個(gè)這樣的數(shù)據(jù)結(jié)構(gòu)并不是很方便，并且是不必要的。 - In the process of developing software , the " binary search " is used to search the " character model " of the characters displayed . the display quality is improved by this means . the real - time process of tester is kept by the method called " time - interrupt "
在軟件程序的設(shè)計(jì)中，采用“折半查找”的快速查找方法完成對(duì)顯示字符“字模”的查找，改善顯示畫面的質(zhì)量；采用“定時(shí)中斷”的方法保證了測(cè)試儀進(jìn)行參數(shù)測(cè)量時(shí)的實(shí)時(shí)性。 - According to the definitions of bottleneck bandwidth , available bandwidth and bulk transfer capacity , we analyzed the algorithms which named vps ( variable packet size ) , pptd ( packet pair / train dispersion ) , slops ( self - loading periodic streams ) and topp ( trains of packet pairs ) ; based on the principle of sub - path bottleneck measurement , we developed the bottleneck measurement algorithm using heterogenous packet - pair train ; after designing the three child algorithms ( demarcating bandwidth range , approaching bandwidth value and predicting the trendency of available bandwidth fluctuation ) , we performed the algorithm called self - loading binary search ; applying the multi - home properties of sctp ( stream controltransmission protocol ) and measurement algorithm of available bandwidth , we presented a scheme to adjust the sctp transport path when there are network congestions or faults ; by the library of winsock and winpcap , we developed a measurement program to look for bottleneck bandwidth . in ns2 experiments , the algorithm based on heterogenous packet - pair train fitted well , and the algorithm of self - loading binary search worked quickly , and the sctp scheme improved the throughput effectively
本文根據(jù)瓶頸帶寬、可用帶寬和btc ( bulktransfercapacity )三類網(wǎng)絡(luò)帶寬定義,分析了vps ( variablepacketsize )和pptd ( packetpair / traindispersion )瓶頸帶寬測(cè)試算法, slops ( self - loadingperiodicstreams )和topp ( trainsofpacketpairs )可用帶寬測(cè)試算法;基于子路徑瓶頸測(cè)試原理,設(shè)計(jì)了異構(gòu)包對(duì)序列的瓶頸測(cè)試算法;并結(jié)合三個(gè)子算法(界定帶寬范圍算法、接近帶寬值算法和帶寬變化趨勢(shì)判定算法) ,設(shè)計(jì)了自載流折半查找的可用帶寬測(cè)試算法;把上面的算法應(yīng)用到sctp ( streamcontroltransmissionprotocal )的多宿性和可用帶寬測(cè)試,提出了一個(gè)網(wǎng)絡(luò)擁塞或故障時(shí)調(diào)整sctp傳輸路徑的方案;結(jié)合winsock和winpcap兩套網(wǎng)絡(luò)開發(fā)工具,設(shè)計(jì)了一個(gè)瓶頸帶寬測(cè)試程序;通過(guò)ns2仿真實(shí)驗(yàn),驗(yàn)證了基于異構(gòu)包對(duì)序列瓶頸測(cè)試算法的準(zhǔn)確性、自載流折半查找算法的快速性,和sctp改進(jìn)方案的有效性。
- binary searchとは意味：二分探索法｛にぶん たんさくほう｝
- 推薦英語(yǔ)閱讀
binary search的中文翻譯，binary search是什么意思，怎么用漢語(yǔ)翻譯binary search，binary search的中文意思，binary search的中文，binary search in Chinese，binary search的中文，binary search怎么讀，發(fā)音，例句，用法和解釋由查查在線詞典提供，版權(quán)所有違者必究。
關(guān)于我們
