It's what we probably all have heard about and something that I will briefly try to describe, what's called the hermeneutic circle.
也许我们大家都听说过,我会简单介绍一下,那就是所谓诠释循环。
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.
好了,二分搜索也许是,最简单的分治算法,这意味着什么?,也就是说,为了解决一个问题,把它切割成小的问题,然后再来一个个解决。
So if you think of a shell, you can actually just think of an egg shell, that's probably the easiest way to think of it, where the yolk, if you really maybe make it a lot smaller might be the nucleus.
可以把它想成,个蛋壳,这也许是,最简单的思考办法,蛋黄如果,缩小非常多倍的话,就可以想象成核子。
So Selection Sort, while it might be easier perhaps to think through than Bubble Sort, or maybe it's pretty much equivalent, it's just a different approach to the same problem.
因此,仔细想想,选择排序也许比,冒泡排序更简单,或者这两者都差不多,只是对同一问题的不同方法而已。
> So this thing here, when green flag clicked say, oh, hi world, this was perhaps the simplest program we could write in Scratch.
>,我们先看看这个例子,“点击绿旗“下面显示“,这也许是我们用Scratch软件写出的最简单的,程序了。
So here is the simplest program which is perhaps an ironic statement that you can implement with this language called C. So it takes a few lines of code to actually get something up and running and as you'll recall last Friday, I didn't even get this up and running because part of the process of writing a program is to one, write it.
让我们回到这个最简单的程序,你们也许觉得啼笑皆非,这么简单的例子,用C语言写出来就可以了嘛,的确只需要几行代码,就可以让这个程序跑起来,就像上周五的那样,我之所以没让它跑起来,因为编程步骤之一,就是“写“
应用推荐