Abstract
The primary aims of the chapter are to introduce the facilities offered by Fortran 95 for the construction and use of dynamic data types. These additional features enable us to solve a much wider range of problems using simple and straightforward algorithms. Examples include the use of pointers in user defined data types, in particular:
-
singly linked lists;
-
trees;
-
using singly linked lists to store sparse vectors.
The secondary aims are to provide a summary of what can be achieved with the correct choice of data structures and algorithms, and the bibliography contains details sources of data structures and algorithms.
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.
20.12 Bibliography
Duff LS., Erismon A.M., Reid J.K., Direct Methods for Sparse Matrices, Oxford Science Publications.
Schneider G.M., Bruell S.C., Advanced Programming and Problem Solving with Pascal, Wiley.
Sedgewick R., Algorithms in Modula 3, Addison Wesley, 1993.
Vowels R.A., Algorithms and Data Structures in F and Fortran, Unicomp, 1998.
Wirth N., Algorithms + Data Structures = Programs, Prentice Hall, 1976.
Wirth N., Algorithms + Data Structures, Prentice Hall, 1986.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag London
About this chapter
Cite this chapter
Chivers, I., Sleightholme, J. (2000). Dynamic Data Structures. In: Introducing Fortran 95. Springer, London. https://doi.org/10.1007/978-1-4471-0403-2_20
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0403-2_20
Publisher Name: Springer, London
Print ISBN: 978-1-85233-276-1
Online ISBN: 978-1-4471-0403-2
eBook Packages: Springer Book Archive