## Notes *Big Omega Notation* describes the lower bound, aka the best-case scenario for time-complexity or space-complexity of an algorithm. ## Steps For a given program: 1. Break the program into smaller segments such that the segments have their own runtime complexities 2. Find the complexity of each segment 3. Add the complexities 4. Remove all constants The resulting Big Omega Complexity is the slowest growing term