Abstract
The design of iterative algorithms on both finite and infinite domains is considered. The principles presented are systematic and lay bare essential features of algorithm construction. Emphasis is on construction of algorithms that are both effective and efficient. In particular, attention is focused on obtaining best worst-case algorithms.