So in fact, what does that suggest about the order of growth here? What is the complexity of this? Yeah. Logarithmic. Why?
复杂度是多少?,对的,对数级的么?,为什么呢?,学生:对数级的?
I start at the beginning of each list, and I say is one less than three?
从每个列表的头开始,那个么1是不是比3小呢?当然?
How would they practice because weren't they prominently farmers?
他们不都是些农夫么,平时怎么操练呢
So if I start off with a list of length n, how many times can I divide it by 2, until I get to something no more than two left?
我能够除以多少次2呢?,直到我得到的长度不超过2么?,对数次,对吧?就像刚才那位同学说的那样?
OK. What's this thing doing then, in terms of sorting?
这是在做什么呢?排序么?,在第一遍结束的时候?
And if I'm running an exponential algorithm, any guesses?
杂度是指数级的呢?,有人猜猜么?
Where was the answer? Somebody?
答案在哪呢?有人回答么?
How do we know this always stops? I mean, I ran three trials here, and it did. But how would I reason about, does this always stop?
我指的是我在这儿试了三次,它都停了,那这是为什么呢?,它总是会停下么?
Is this what I should be getting? No.
的正确结果么?不是,那哪儿错了呢?
应用推荐