Computer Science, Python, Big O Notation, Time Complexity, Algorithms.
understand is the concept of the drop constant. Simply put, this means that we don’t include constant numbers in the O(n) notation. For instance, if we have an algorithm that executes two identical functions, it would be considered as running at O(2n). However, we would drop the 2 and only write it