Karelle Hoflerkarellehofler.hashnode.dev·Sep 3, 2023Big O NotationBig O notation is primarily used to describe the upper bound or worst-case time complexity of an algorithm. It provides an estimation of how an algorithm's runtime will grow as the input size increases to its largest possible value. In this article, ...5 likes·35 reads2Articles1WeekAdd a thoughtful commentNo comments yetBe the first to start the conversation.