A New Programming Technique Derived from Dijkstra’s Methodology

DOI10.1080/02522667.1986.10698861zbMath0608.68007OpenAlexW2071096454MaRDI QIDQ3747703

M. C. Er

Publication date: 1986

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1986.10698861

zbMATH Keywords

2-D search of an 2-D arraylinear search of a linked listsearching-and-updating problemtermination indicators

Mathematics Subject Classification ID

Searching and sorting (68P10) General topics in the theory of software (68N01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Critical comments on the programming language Pascal
• Jumping About and Getting into a State
• Jumping to some purpose

This page was built for publication: A New Programming Technique Derived from Dijkstra’s Methodology