Jan 21, 2018
4 min read
Big O Algorithm Analysis
Big O Algorithm Analysis Using Code Snippets
In computer science, algorithm analysis determines the amount of resources (such as time and/or storage) necessary to execute that algorithm or program. Usually, the running time or efficiency of an algorithm is represented as a function relating the input size to the number of steps (time complexity) or storage locations (space complexity).
