Abstract
‘Analysis of algorithms’ is quite important in computer programming, because there are generally several algorithms available for a particular application and we would like to measure and compare the time and storage requirements. Time may be measured by counting steps, statements, or the number of times some given operation is performed; space may be measured by bits, words, or the number of registers and cells required during execution of the algorithm.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Kemp, R. (1984). Introduction. In: Fundamentals of the Average Case Analysis of Particular Algorithms. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-663-12191-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-663-12191-6_1
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-519-02100-1
Online ISBN: 978-3-663-12191-6
eBook Packages: Springer Book Archive