🚀 Big O Notation Simplified: 🟢 O(1) – Constant (arr[i]) 🔵 O(log n) – Log (Binary Search) 🟡 O(n) – Linear (for loop) 🟠 O(n log n) – Merge Sort 🔴 O(n²) – Nested loops 💡 Always aim for better time complexity! #BigONotation #DSA #Coding #StartupLife