Algorithm Complexity (aka. the "Big Oh" thing)
Algorithm complexity is a measure of how much it takes to run a certain algorithm. The "it" thing could be either time or memory. The longer or larger the algorithm takes to complete their operation. The shortest possible value of complexity would be O(1), where for every number of inputs,…
Continue reading...