-
So I'm going to solve this by enumerate and check, which is an example of what's called a brute-force algorithm.
你懂的,所以我得靠列举和检验来解决这个问题,这就是我们说的穷举算法。
-
Now, as obvious a statement as that is in this algorithm, it turns out that is the key to this whole problem being solved correctly without my algorithm looping infinitely.
这是此算法中很明显的一句话，也是正确解决,整个问题的关键,否则此算法就会陷入死循环。
-
OK. Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean? It says, in order to solve a problem, cut it down to a smaller problem and try and solve that one.
好了，二分搜索也许是,最简单的分治算法，这意味着什么？,也就是说，为了解决一个问题,把它切割成小的问题,然后再来一个个解决。
-
OK. At this point, if we stop, you'll think all algorithms are linear. This is really boring.
可能我们就认为所有的解决这个问题的，算法都是线性增长的了，真很没意思,但是他们真不是对不对？
-
What you're much better at doing is saying how do I take the problem I've got and map it into a class of algorithms about which I know and use the efficiencies of those to try and figure out how to make it work.
当你碰到问题的时候,更好的方法是把遇到的问题映射,到已经设计好的算法中去,并用这些算法来提高效率,来保证问题得到解决。
-
PROFESSOR: Great question. So the question is, how do you choose an algorithm, why would I choose to use a pseudo-polynomial algorithm when I don't know how big the solution is likely to be, I think that's one way to think about it.
教授：问得好，所以问题是，你怎样选择算法，为什么当我,不知道解决方案会有多大的时候,我要选伪多项式算法呢，我想这是一种思考问题的方式。
-
The algorithm on mine professed to be implementing now is this thing.
这个算法现在要,解决的就是这个问题。
-
So things that are good candidates for divide And conquer are problems where it's easy to figure out how to divide down, and the combination is of little complexity.
因为适合用分治算法解决的问题,最好是能够简单的将问题进行分解,并且合并的过程不是非常的复杂,只要比线性方案要小。
-
In Week 2 we'll look at things like cryptography and functions and the tools that by which you begin to assemble solutions to problems; in Week 3 we'll introduce what are generally ; known as algorithms and data structures; mechanisms by which you can solve problems more efficiently, effectively.
第2周,我们学习加密技术及其功能,还会学到一些操作工具,通过这些工具的使用来收集解决问题的办法,第3周,我们将介绍;,算法和数据结构,以及可以更有效地解决问题的机制。
-
That's an important observation, and as we get to the part of the course we talk about computational complexity, you'll see that what we really care about is not how efficient the program is on easy problems but how efficient it is on hard problems.
我们已经学习了这门课程的一部分了，我们要开始认识到,计算的复杂度这个概念，你会学习到我们在乎的并不是,算法在简单问题上的工作效率,而是解决复杂问题的效率。
-
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是一千,或者是大规模的任何问题。
应用推荐