What's the order of complexity of merging?

归并的复杂度是多少？

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

So in fact, what does that suggest about the order of growth here? What is the complexity of this? Yeah. Logarithmic. Why?

复杂度是多少？,对的，对数级的么？，为什么呢？,学生：对数级的？

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

In the linear case, meaning in the unsorted case what's the complexity of this? k times n, right? Order n to do the search, and I've got to do it k times, so this would be k times n.

复杂度是多少？k的n次方，对吧？,在序列n中做搜索，要做k次，所以是k的n次方次,如果先排序后搜索。

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