Abstract
We often need to evaluate a software system for its efficiency in using time and memory. A simple approach to the evaluation is running the software for a benchmark problem on some platform. We can measure the time and memory space used by the execution. The quantities give us an idea about the speed and memory demand of the system when it is faced with a similar problem on a similar platform. Potential users of the software system may use the values to judge the software system.
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
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Li, L. (1998). Complexity Analysis. In: Java: Data Structures and Programming. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95851-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-95851-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-95853-3
Online ISBN: 978-3-642-95851-9
eBook Packages: Springer Book Archive