The reason for this is that a linear search doesn't require the elements to be sorted and its algorithm is a lot less complicated. So for a small number of items a linear search is ideal.

在CSimpleBinaryTree 中有两个搜索算法.线性搜索和对半搜索.线性搜索只在树种子项数目小于指定值的时候才使用 (缺省为10),从这个点以后的各项，将使用对半搜索.这样做的原因是线性查找不要求元素进行排序并且它的运算规则相对要简单的多.因此对于小数目项来说，线性查找是理想的.

youdao

Such tight coupling of components increases the danger of “non-linear” outcomes, where a small change has a big impact.

如此紧密的联系使得“非线性”结果风险大大增加，很小的一个变数就会产生很大的影响。

youdao

A granite platform (Granite Flat Panel) was a long-term natural aging, organizational structure, uniform, linear expansion coefficient is extremely small, internal stress disappear, not deformed.

花岗石平台（花岗石平板）经长期天然时效，组织结构均匀，线胀系数极小，内应力完全消失，不变形。

youdao

You try to design actually I'm going to come back to that in a second. It's like you're trying to use a hash function that spread things out pretty evenly. But the places you store into in those lists may have to themselves have a small list in there, and when you go to check something, you may have to do a linear search through the elements in that list.

你尝试着去设计,实际上过会儿我会回头讲解这个问题,类似于你需要用一个哈希函数,非常平均的将物体分发出去,但是在列表中你数据,映射到的地方可能会有自己的一小段列表，当你回头查找数据的时候,你可能需要在那一小段列表中做线性查找。

麻省理工公开课 - 计算机科学及编程导论课程节选