Chapter 11
DESIGN OF ALGORITHMS
11.1 INTRODUCTION
Basically, the word algorithm was applied to procedures of elementary arithmetic, such as long addition and long multiplication. When we first learn the procedure for long addition in school, we do not have to understand the logical foundations of the procedure; all that is required is the ability to carry out the correct steps in the correct order. In general, we can say that an algorithm is a sequence of instructions or it is an effective computational procedure, whereas procedure is a finite specification of step-by-step instructions.
A computational procedure is one that in principle could be carried out by a computer the result or output of which is depending only on the syntactic form of ...
Get Discrete Mathematics by Pearson now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
