Algorithms, Technology, Asymptotic Notation.
refers to the upper bound of an algorithm. For example, consider the case of Insertion Sort. It takes Θ(n) in the best case scenario and Θ(n^2) in the worst case scenario, so we safely say the time complexity of insertion sort cannot be worse than Θ(n^2) but can be better. In this case, we will