我的应用程序并不需要列表搜索。

My app didn't require list searching.

youdao

欢迎您通过这些列表搜索，看看是否有与您兴趣相匹配的。

You are welcome to search through these and see if any is a match for your interests.

youdao

“智能列表”允许你保存基于你搜索关键字的任务列表搜索结果，并能让你定制化的创建你自己列表的视图；

“Smart Lists” allow you to save searches based on any criteria that a task may have allowing you to create customized views of your lists

youdao

If it was an unordered list, we were basically stuck with linear search. Got to walk through the whole list to see if the thing is there.

如果是一个未排序的列表,基本上我们就只能使用线性搜索了,通过遍历整个列表来查看。

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

So when I do the analysis, I want to think about what am I doing here, am I capturing all the pieces of it? Here, the two variables that matter are what's the length of the list, and how many times I'm going to search it?

这里，要关注的,两个变量是列表,的长度以及我要搜索的次数,这种情况下，这个算法赢了？

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

And what does that say? It says, let's assume I want to do k searches of a list. OK.

如果我们假定要在列表中做k次搜索,在线性的情况下，假定是一个未排序的情况。

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