Big-O Notation
BIG-O NOTATION (This is my quick notes to understand big-O notation) Big-O notation is used to describe the performance or complexity of an algorithm. Specifically, it describes the worst-case scenario in terms of time or space complexity. Let's understand these with real life examples. O(1) : Constant Time , O(1) means that an algorithm takes a constant time to run, regardless of the size of the input. Example: Imagine using bookmarks in a book. When you want to find the last ...