Big O Notation - Full Course
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: https://www.youtube.com/channel/UC5UgemAz061hkjTFHOfxNpg
π Twitter: https://twitter.com/kantancoding
π Instagram: https://www.instagram.com/kantancoding
βοΈ 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
β¨οΈ (1:02:50) O(n log n) Coding Merge Sort
β¨οΈ (1:17:04) O(n log n) Merge Sort Complexity Deep Dive
β¨οΈ (1:28:06) O(2^n) Explanation With Fibonacci
β¨οΈ (1:36:02) O(n!) Explanation
β¨οΈ (1:47:19) Space Complexity & Common Mistakes
β¨οΈ (1:55:53) End
π Thanks to our Champion and Sponsor supporters:
πΎ Wong Voon jinq
πΎ hexploitation
πΎ Katia Moran
πΎ BlckPhantom
πΎ Nick Raker
πΎ Otis Morgan
πΎ DeezMaster
πΎ Treehouse
πΎ AppWrite
--
Learn to code for free and get a developer job: https://www.freecodecamp.org
Read hundreds of articles on programming: https://freecodecamp.org/news