bug What I typically do is I start with the input that provoked the problem, and I keep making it smaller and smaller.

我这里做的就是从引起,出现的输入开始，然后将输入，一步步的缩小规模。

麻省理工公开课 - 计算机科学及编程导论课程节选

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 you try and find a smaller input that bug will produce the problem.

你应该尝试着用规模小一点的输入,去重现这个。

麻省理工公开课 - 计算机科学及编程导论课程节选

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?

普遍存在的增益和权衡,在许多的例子中,可以通过牺牲空间而得到效率方面的增加,话说回来，仍然存在一个问题,或者应该会有一个问题困扰着你,就是我如何保证我的哈希函数能够准确将,任一输入映射到相应的唯一的存贮空间中去？

麻省理工公开课 - 计算机科学及编程导论课程节选

So the running time of the problem where the input is T of size N as expressed here formulaically, T of N, the running time of an algorithm, given an input of size N. You know what?

因此一个输入为N的问题的运行时间,在这儿的公式表示为，如果输入为N，那么此算法的运行时间,是多少呢？

哈佛公开课 - 计算机科学课程节选