Loading chapter4.tex +1 −1 Original line number Diff line number Diff line Loading @@ -877,7 +877,7 @@ for each component into clearly defined algorithms and data structures. An algorithm is a procedure, described as a finite number of rules, for accomplishing a certain task. The rules must be unambiguous and guaranteed to terminate after a finite number of applications. (The word is named for the ninth century Persian mathematician \person{al-Khowarizimi}.) the ninth century Persian mathematician \person{al-Khowarizmi}.) An algorithm lies halfway between the imprecise directives of human speech, such as ``Please sort these letters chronologically,'' and the Loading Loading
chapter4.tex +1 −1 Original line number Diff line number Diff line Loading @@ -877,7 +877,7 @@ for each component into clearly defined algorithms and data structures. An algorithm is a procedure, described as a finite number of rules, for accomplishing a certain task. The rules must be unambiguous and guaranteed to terminate after a finite number of applications. (The word is named for the ninth century Persian mathematician \person{al-Khowarizimi}.) the ninth century Persian mathematician \person{al-Khowarizmi}.) An algorithm lies halfway between the imprecise directives of human speech, such as ``Please sort these letters chronologically,'' and the Loading
