Abstract
In Chapter 1 we introduced the concept of an algorithm. Our main purpose at that stage was to define a language, or pseudocode, in which algorithms could be written. We have been using the ideas of Chapter 1, and the pseudocode notation in particular, throughout this book.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1995 Peter Grossman
About this chapter
Cite this chapter
Grossman, P. (1995). Algorithms and Computational Complexity. In: Discrete Mathematics for Computing. Palgrave, London. https://doi.org/10.1007/978-1-349-13908-8_13
Download citation
DOI: https://doi.org/10.1007/978-1-349-13908-8_13
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-64694-6
Online ISBN: 978-1-349-13908-8
eBook Packages: EngineeringEngineering (R0)