Please enable JavaScript.
Coggle requires JavaScript to display documents.
Algorithmic Complexity, References:, Wilf, Herbert S. "Algorithms and…
Algorithmic Complexity
:check: Definition
A measure of how long an algorithm would take to complete given an input of size n. It is concerned about how fast or slow particular algorithm performs
Algorithmic Complexity falls within a branch of theoretical computer science called Computational Complexity theory
:star: Complexity Theory
Analysis of an algorithm's Complexity is helpful when comparing algorithms and seeking for improvements.
Complexity is usually in terms of time, but it can be in term of space, recursion or amortized analysis.
:red_cross: It doesn't concern itself with actual execution time, which depends on processor speed, instruction set, disk speed, compile programming languages, hardware & memories are all external factors.
-
:star: Time Complexity
Time Complexity of an algorithm quantifies the amount of time taken by an algorithm to run a function of length of the string.
Time Complexity is most commonly estimated by counting the number of elementary steps performed by any algorithm to finish execution
=> Generally when we talk about time complexity, we refer to the worst-case scenario, avg-case scenario and best-case scenario
-
-
-
Wilf, Herbert S. "Algorithms and complexity".2002 Link Title