We want to write a piece of code that helps these guys out, so I'm going to show you an example.
通过写一段代码,来解决一个这样的问题,接下来让我们来看个例子。
In a help session what he might do typically is solve between four and eight problems that illustrate the key principle being talked that week.
在帮助课程中他一般会,解决4到8个问题,来阐明那一周教的关键原理。
What does it require to be a successful mechanic, to do all the mechanics problems?
怎么才能当个成功的力学家,并能解决所有的力学问题呢
So now I have this right hand side of the 4-cup problem.
现在就解决4个杯子问题中的右半部分。
So I propose this as a new algorithm for sorting N elements and being 8 in this case or really a thousand in the case of the phonebook, or anything of larger size.
所以我提出一种新的算法,来解决N个元素的排序问题,在这个问题中N是8,在电话簿的问题中N是一千,或者是大规模的任何问题。
应用推荐