TimeComplexity.md (272B)
1 # Time Complexity 2 3 Ch 2 4 5 **Definition:** Let A be an algorithm. The worst case, best case, or average case time complexity of A is the function f: N->N where f(n) is the max, min, or average number of instructions executed by the algorithm for all inputs of size n bytes.