Abstract
In this chapter we describe the language we use in this book to present algorithms. The language we have chosen does not represent any particular programming language, because we do not want to delve too deeply into the technicalities involved in preparing a concrete computer program. The langauge we use is a combination of features found in present-day programming languages which we feel are most useful to keep the presentation reasonably detailed but simple. A person with some experience in programming should have no problem in rewriting our algorithms in a concrete programming language.
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
© 2004 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Kaczynski, T., Mischaikow, K., Mrozek, M. (2004). Syntax of Algorithms. In: Computational Homology. Applied Mathematical Sciences, vol 157. Springer, New York, NY. https://doi.org/10.1007/0-387-21597-2_14
Download citation
DOI: https://doi.org/10.1007/0-387-21597-2_14
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2354-7
Online ISBN: 978-0-387-21597-6
eBook Packages: Springer Book Archive