Abstract
This chapter deals with the Fortran implementation of some common algorithms from computer science that have many applications in science and engineering. These include algorithms for searching and sorting lists of data and algorithms for recursively defined functions. These algorithms are implemented as subroutines and functions in MODULES so that they can be incorporated into your own programs even if you don’t spend much time understanding the details of their operation.
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). Some Essential Programming Algorithms. 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_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1952-1_10
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