Big O notation in simple terms
< 1 min readBig O notation is a way of expressing the performance or complexity of an algorithm, and it is commonly used in computer science to describe the execution time or space required by an algorithm. In simple terms, Big O notation represents the worst-case scenario for the performance of an algorithm. It describes how the execution…
