-
So before we use printf, a function, and we passed in one input and input henceforth we're gonna call arguments or parameters.
我们在使用printf函数时,先放进去一个输入，之后的输入我们就要,调用参数了。
-
One of the things you could imagine is just try it on and input, see how long it takes.
你们想出来的方法只是可能就是通过,输入来试试，看运行时间会有多长。
-
You have to pass it as input to another function, as you'll see as possible in problem's Set One specification, but it's ultimately up to you.
你需要把它传给另一个函数当入参，就像你们将,在习题集1中可能看到的，但它最终取决于你。
-
So, it makes a binary decision, either I create an action potential or I don't, but that decision could be based on many inputs, not just on input from one cell.
所以 这里产生一个二选一的决策,就是产生动作电位亦或不产生,不过这个决定可能是,根据很多输入信号做出的,而不是仅凭单个细胞所传来的信号
-
We're going to build up this taxonomy if you like, but the reason it's relevant is, associated with each one of those types is a set of operators that expect certain types of input in order to do their job.
我们将会建立这种分类，但是这相关的原因是，对于每种类型都有,和之对应的一个操作集,这个操作机对一些输入,做出规定的操作。
-
OK. So to do this, we're going to have to do a couple of things. All right, the first one is, what do we mean by input size?
好，为了实现这种方法我们,有些事情要做，第一件事情就是，当我们说到输入的大小的时候代表了什么呢？
-
One is, what's the thing I print out when I ask for the input?
第一件是当我要求输出的时候,我输出的内容？
-
The answer is I can't. OK, in the simple case of integers I can, but in the case of something more complex like faces or fingerprints or passwords for that matter, it's hard to design a hash function that has completely even distribution, meaning that it takes any input into exactly one output spot.
答案是我不能，好吧,在简单的整数的例子中,我可以做到，但是在一些更复杂的场景中,比如面部，指纹，密码相关的问题中，很难设计一个哈希函数具备完全平均的分配,也就是说，做到对任一输入，可以准确地得到相应的唯一输出,因此在一个哈希问题中。
-
That's the question we're going to try and address. If we can do this, this is good, because first of all, it removes any questions about what machine I'm running on, it's talking about fundamentally, how hard is this problem, and the second thing is, it is going to do it specifically in terms of the input. Which is one of the things that I was worried about.
这是一个我们接下来要去,尝试和解决的问题，如果我们能做到的话会很不错，因为首先，它解决了结果可能和我,运行的计算机有关系的问题，因为这从根本了告诉了，我们这个问题的复杂度，第二件事情,就是这种方法可以依据输入的大小来计算,而这正是我最担心的地方。
-
That in many cases, I can gain efficiency if I'm willing to give up space. Having said that though, there may still be a problem, or there ought to be a problem that may be bugging you slightly, which is how do I guarantee that my hash function takes any input into exactly one spot in the storage space?
普遍存在的增益和权衡,在许多的例子中,可以通过牺牲空间而得到效率方面的增加,话说回来，仍然存在一个问题,或者应该会有一个问题困扰着你,就是我如何保证我的哈希函数能够准确将,任一输入映射到相应的唯一的存贮空间中去？
-
Why is this much nice? Well, that's a handy piece of code. Because imagine I've got that now, and I can now store that away in some file name, input dot p y, and import into every one of my procedure functions, pardon me, my files of procedures, because it's a standard way of now giving me the input.
为什么这样很好呢？,这是一段很好用的代码,因为想象下如果我有了这段代码,我能把它用某个文件名保存起来,后缀是。py，导入到所有的处理函数中,抱歉，我的处理文件,因为这是一个标准的输入方法。
应用推荐