A New Programming Technique Derived from Dijkstra’s Methodology
M. C. Er · Journal of Information and Optimization Sciences · 1986
A new programming technique is derived from Dijkstra’s programming methodology by introducing auxiliary variables into a postcondition and an invariant. Such auxiliary variables will serve as termination indicators in a resulting program. It is illustrated that an application of this new programming technique to the searching-and-updating problem yields an efficient and transparent algorithm which does not depend on a specific facility of a programming language. The generality of this new programming technique is further demonstrated by its applicability to other programming problems, such as the linear search of a linked list and the 2-D search of an 2-D array.