Unlike binary data, XML is highly structured, and many parsers and tools are optimized to search and query XML data.
和二进制数据不同，XML是高度结构化的，很多解析器和工具针对 XML 数据搜索和查询进行了优化。
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.
在上面的示例中，如果使用一个简单的散列图(hashmap)或二进制搜索树就可以轻易地解决问题，但是用XSL实现一个这样的数据结构并不是很方便，并且是不必要的。
As an artificial example, I'll implement a trivial back end for a Wikipedia-like encyclopedia system, called JCRWiki, with support for binary content, versioning, backup, and search.
作为一个假设的示例，我将为一个类似维京百科全书的、叫做JCRWiki 的系统实现一个小小的后端，为二进制内容、版本管理、备份和搜索提供支持。
It maintains the free space in heap as nodes in a Cartesian binary search tree format.
它按照Cartesian二分法检索树格式以节点的形式维护堆中的空闲空间。
A binary search tree (BST) is a binary tree with the following properties.
二进制搜索树(BST)是具有以下属性的二进制树。
If you use Mac OS X or Windows and prefer the convenience of a pre-built binary, you can find such software on the Web by way of a simple Google search.
如果使用MacOSX或Windows并且更喜欢便捷的预构建二进制，则可以通过简单的Google搜索在Web上找到此类软件。
Using this notation, you should know that search through a list is O(n) and binary search (through a sorted list) is log(n).
看到这个标记你就应该知道搜索链表的复杂度为O(n)，进行二进制搜索时（已排序）的空间复杂度为log(n)。
OK. At the end of the lecture last time, I also showed you an example of binary search.
好的，在上次课程的最后，我也给你们看了一个二分查找的例子。
And the algorithms are just as important - from binary search to different sorts to graph traversals, a rockstar engineer must know and internalize the basics.
算法也同样重要，从二分查找到各种排序，到图形遍历，一位明星工程师必须知道并内在消化这些基础东西。
The swat binary is called, unsurprisingly, swat, so you can search for that program file to see if swat is available on your computer.
毫不奇怪，swat二进制文件名为swat，因此您可以搜索该文件，查看您的计算机上是否有swat。
At least wide receivers have to run, whereas I can guarantee you, without fear of contradiction, that no software engineer will ever have to write a binary search after they are hired.
因为至少接球员是需要跑的，而我却可以无所畏惧的向你保证，没有哪个被聘用的软件工程师必须写一个二分查找程序。
Add and Remove operations are typically expensive since Binary Search Trees require that a tree be balanced.
添加和删除操作的开销是很大的，只主要是因为对半查找树的平衡性所决定的。
I'm narrowing it down. It's getting a little silly but you know I'm going to really be persistent and just follow the rules here of binary search, rather than jumping to conclusions.
按照二分法的规则来做的,而不是直接得出某种结论,很明显这儿我的目的是什么？,显示这两个相同的东西。
Now, one of the questions we could still ask is, right, we've got binary search, which has got this nice log behavior.
目前，还有一个问题我们仍然要问的是，对，我们已经学了二分查找，有着非常好的log级别的行为。
And, of course, they asked new university graduates about computer science theory; "Write me a binary search."
当然，他们也问刚毕业的大学生一些关于计算机科学理论的问题，如：请写一个二分查找程序。
An improved binary code method was proposed, which introduced several parameters to conveniently control the solution precision and search space.
提出了一种改进的二进制编码方法，引入若干参数用以方便地控制了解的精度和搜索空间。
Because the words are in alphabetical order, we can speed things up with a bisection search (also known as binary search), which is similar to what you do when you look a word up in the dictionary.
我们知道这些单词是按照字母表顺序组织的，所以我们可以加速一下，用一种对折搜索（也叫做二元搜索），这个过程就和你在现实中用字典来查单词差不多。
An improved binary code method is also proposed, which introduces several parameters to conveniently control the solution precision and search space.
同时提出了一种改进的二进制编码方法，该方法引入了若干参数用以方便地控制解的精度和搜索空间。
An improved binary coding method is proposed, which introduces several parameters to control the solution precision and search space efficiently.
提出了一种改进的二进制编码方法，该方法引入了若干参数用以控制解的精度和搜索空间。
The elementary binary search algorithm and some im - proved algorithms are compared and analyzed quantified in detail, and a novel improved algorithm is proposed.
在对基本二进制搜索算法及其各种改进算法进行详细的定量分析的基础上提出了一种改进算法。
This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree.
本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。
The algorithm takes advantage of the theories of bidirectional search, projection, minimum Angle and binary tree.
算法基于双向式搜索原理，采用投影法、夹角最小的方法及二叉树理论。
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.
用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。
It can search both text and binary files using either ordinary text or GREP-like regular expressions, based on the standard UNIX search utility.
它可以搜索文本和二进制文件使用普通的文本或grep一样的正则表达式的基础上，标准的Unix搜索工具。
It can search both text and binary files using either ordinary text or GREP-like regular expressions, based on the standard UNIX search utility.
它可以搜索文本和二进制文件使用普通的文本或grep一样的正则表达式的基础上，标准的Unix搜索工具。
应用推荐