计算机专业英语chapt5_1Algorithms and Flowcharts.ppt

5.1 Words Algorithm n. [数]算法 decision n. 决定，判断 discipline n. 纪律，学科 v. 训练 iteration n. 迭代，重复，反复 procedure n. 程序 pseudocode n. 伪代码 Repetition n. 重复，循环 sequence n. 顺序，序列 structure n. 结构 v. 构成，组织 terminate v. 停止，结束 5.1 Algorithms and Flowcharts The computer scientist Niklaus Wirth stated that: Programs = Algorithms + Data The algorithm is part of the blueprint or plan for the computer program; an algorithm is: “An effective procedure for solving a problem in a finite number of steps.” 计算机科学家Niklaus Wirth提出这样的公式：程序=算法+数据。 算法是计算机程序的蓝图或计划的一部分，一个算法就是：“用有限的步骤解决问题的有效的过程。” 所谓有效，就是说找到了答案并且停止了，也就是说有有限的步骤。一个设计良好的算法总是能得到答案，也许不是希望的答案但是会有答案。也可能答案本身就是没有答案。一个设计良好的算法应该保证能够终止。 It is effective, which means that an answer is found and it finishes, that is it has a finite number of steps. A well-designed algorithm will always provide an answer, and it may not be the answer you want but there will be an answer. It may be that the answer is that there is no answer. A well-designed algorithm is also guaranteed to terminate. 算法的主要特征如下： 顺序（或者处理）、 判断（或者选择）、 循环（或者重复）。 The key features of an algorithm are: Sequence (also known as Process) Decision (also known as Selection) Repetition (also known as Iteration or Looping) 数学家Bohm和Jacopini于1964年证明：任何一个程序均可用“顺序”、“判断”和“循环”来陈述。Bohm和Jacopini的工作非常有意义，因为它最终形成了当前应用广泛的结构化定理。 In 1964 the mathematicians Corrado Bohm and Guiseppe Jacopini demonstrated that any algorithm can be stated using sequence, decision and repetition. The work of Bohm and Jacopini was of great importance since it eventually led to the disciplines of structured program design that are much used today. 顺序算法就是处理过程的每一步以特定的顺序执行，在这种算法中的每一个过程要处在正确的位置，否则算法可能会失败。 判断结构——If…then…, If…then…else… Sequence means that each step or process in the algorithm is executed in the specified order. In an algorithm each process must be in the correct place, otherwise the algorithm will most probably fail. The Decision constructs—If ...