This course will teach you how to understand and apply the concepts of Big O Notation to Software Engineering. Big-O notation is a way to describe how long an algorithm takes to run or how much memory is used by an algorithm.
✏️ This course was developed by selikapro. Check out his channel:
🔗 Twitter:
🔗 Instagram:
⭐️ Course Contents ⭐️
⌨️ (0:00:00) Intro
⌨️ (0:00:39) What Is Big O?
⌨️ (0:07:08) O(n^2) Explanation
⌨️ (0:14:06) O(n^3) Explanation
⌨️ (0:26:29) O(log n) Explanation Recursive
⌨️ (0:31:12) O(log n) Explanation Iterative
⌨️ (0:36:08) O(log n) What Is Binary Search?
⌨️ (0:41:30) O(log n) Coding Binary Search
⌨️ (0:58:12) O(n log n) Explanation
⌨️