Principles of data structures and algorithms with Pascal
Principles of data structures and algorithms with Pascal
Introduction to algorithms
Algorithms in C++
Data Structures and Algorithms
Data Structures and Algorithms
| Hi-index | 0.00 |
In discussing problem solving, we presuppose both a problem and a device to be used in solving the problem. The problem may be mathematical or non-mathematical in nature, simple or complex. The basic requirements for a well-posed problem are that (1) the known information is clearly specified; (2) we can determine when the problem has been solved; and (3) the problem does not change during its attempted solution. The second requirement does not mean that the solution to the problem is known a priori, but only that we know when the solution has been attained. For example, in some numerical problems we obtain repeated approximations to the answer, terminating the solution process when two successive approximations are "sufficiently close" together. We can specify in the problem statement the exact meaning of "sufficiently close" without knowing the exact answer. The device to be used for problem solution may be human or machine, or a combination of the two.