Abstract
After completing this module, a student should be able to:
-
List computing environment components affecting performance.
-
List and rank the standard Big-Oh computational complexity functions.
-
Determine the time complexity function of an algorithm.
-
Classify an algorithm by its standard Big-Oh function.
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
References
Wilensky U (1999) NetLogo. http://ccl.northwestern.edu/netlogo/. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL
Wilensky U (2005) NetLogo merge sort model. http://ccl.northwestern.edu/netlogo/models/MergeSort. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL
Acknowledgement
The original version of this module was developed by Dr. Larry Vail.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Brewer, K., Bareiss, C. (2016). Procedures: Performance and Complexity. In: Concise Guide to Computing Foundations. Springer, Cham. https://doi.org/10.1007/978-3-319-29954-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-29954-9_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29952-5
Online ISBN: 978-3-319-29954-9
eBook Packages: Computer ScienceComputer Science (R0)