Abstract
The aims of this chapter are to provide an introduction to algorithms and their behaviour. In Computer Science this is normally done using the so called big O notation.
Errors using inadequate data are much less than those using no data at all.
Charles Babbage
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Chivers, I., Sleightholme, J. (2015). An Introduction to Algorithms and the Big O Notation. In: Introduction to Programming with Fortran. Springer, Cham. https://doi.org/10.1007/978-3-319-17701-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-17701-4_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17700-7
Online ISBN: 978-3-319-17701-4
eBook Packages: Computer ScienceComputer Science (R0)