Big O Notations - Understanding Algorithm Efficiency
Offered By: Derek Banas via YouTube
Course Description
Overview
Learn about Big O notations in this 21-minute tutorial video. Explore how computer algorithms scale as data volume increases, covering O(1), O(N), O(N^2), O(log N), and O(N log N) notations. Gain a simplified understanding of these concepts through clear explanations and practical examples. Discover how Big O notations are used to measure algorithm efficiency, not just in terms of speed but also in relation to data growth. Follow along with the provided code examples to reinforce your understanding of these fundamental computer science concepts.
Syllabus
Big O Notations
Taught by
Derek Banas
Related Courses
数据结构与算法第二部分 | Data Structures and Algorithms Part 2Peking University via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera Introduction to Automata, Languages and Computation
Indian Institute of Technology, Kharagpur via Swayam Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues
Georgia Institute of Technology via edX Learning Algorithms in JavaScript from Scratch
Udemy