Archive | 2019

Big-O Notation

 

Abstract


Before learning how to implement algorithms, you should understand how to analyze the effectiveness of them. This chapter will focus on the concept of Big-O notation for time and algorithmic space complexity analysis. By the end of this chapter, you will understand how to analyze an implementation of an algorithm with respect to both time (execution time) and space (memory consumed).

Volume None
Pages 1-11
DOI 10.1007/978-1-4842-3988-9_1
Language English
Journal None

Full Text