Abstract
This chapter describes how to design modularized Fortran programs. It begins with a discussion of algorithms that use the CALL and SUBPROGRAM commands from the pseudocode language of Chapter 2. It then shows how to implement these algorithms using Fortran subroutine and function subprograms.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Brooks, D.R. (1997). Program Modularization. In: Problem Solving with Fortran 90. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1952-1_7
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1952-1_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7353-0
Online ISBN: 978-1-4612-1952-1
eBook Packages: Springer Book Archive