Big-O Notation
= a notation to describe the ⚡️ Efficiency of an ⚙️ Algorithm using ᦛ Levels of complexity
Rules
- ignore constants
- only look at “worst case”
- multiply loops on different levels, add on same
Search
Aug 04, 2024, 1 min read
= a notation to describe the ⚡️ Efficiency of an ⚙️ Algorithm using ᦛ Levels of complexity