Abstract
Let us follow the steps of development of a simple program and thereby explain some of the fundamental concepts of programming and of the basic facilities of Modula. The task shall be, given two natural numbers x and y, to compute their greatest common divisor (gcd).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wirth, N. (1983). A first example. In: Programming in Modula-2. Texts and Monographs in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96757-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-96757-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-96759-7
Online ISBN: 978-3-642-96757-3
eBook Packages: Springer Book Archive