What Is Big O? (Comparing Algorithms)
With so many ways to solve a problem, how do we know which was is the right one? Let's look at one of the most common methods for analyzing algorithms: Big O Notation.
Created by: Cory Chang
Produced by: Vivian Liu
Script Editor: Justin Chen, Brandon Chen, Elaine Chang, Zachary Greenberg
Twitter: https://twitter.com/UBehavior
—
Extra Resources:
Big O Wiki: https://en.wikipedia.org/wiki/Big_O_notation
Analysis of Algorithms: https://en.wikipedia.org/wiki/Analysis_of_algorithms
Time Complexity: https://en.wikipedia.org/wiki/Time_complexity
Sorting: https://en.wikipedia.org/wiki/Sorting_algorithm
Fast Inverse Square Root: https://en.wikipedia.org/wiki/Fast_inverse_square_root
Picture Credits:
https://s-media-cache-ak0.pinimg.com/originals/71/08/80/7108806b2c021ac3fba90f55983a4c5c.png
Видео What Is Big O? (Comparing Algorithms) канала Undefined Behavior
Created by: Cory Chang
Produced by: Vivian Liu
Script Editor: Justin Chen, Brandon Chen, Elaine Chang, Zachary Greenberg
Twitter: https://twitter.com/UBehavior
—
Extra Resources:
Big O Wiki: https://en.wikipedia.org/wiki/Big_O_notation
Analysis of Algorithms: https://en.wikipedia.org/wiki/Analysis_of_algorithms
Time Complexity: https://en.wikipedia.org/wiki/Time_complexity
Sorting: https://en.wikipedia.org/wiki/Sorting_algorithm
Fast Inverse Square Root: https://en.wikipedia.org/wiki/Fast_inverse_square_root
Picture Credits:
https://s-media-cache-ak0.pinimg.com/originals/71/08/80/7108806b2c021ac3fba90f55983a4c5c.png
Видео What Is Big O? (Comparing Algorithms) канала Undefined Behavior
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Introduction to Big O Notation and Time Complexity (Data Structures & Algorithms #7)Math's Existential Crisis (Gödel's Incompleteness Theorems)What is complexity theory? (P vs. NP explained visually)Asymptotic Bounding 101: Big O, Big Omega, & Theta (Deeply Understanding Asymptotic Analysis)P vs. NP - An IntroductionWhy My Teenage Code Was Terrible: Sorting Algorithms and Big O NotationWhat Makes P vs. NP So Hard? (P ≠ EXPTIME, Time Hierarchy, Baker-Gill-Solovay)You MUST learn this BEFORE you learn algorithms (Big O)Getting Sorted & Big O Notation - ComputerphileAlan Turing - Giants of Computer ScienceComplete Beginner's Guide to Big O NotationImpossible Programs (The Halting Problem)NP: How Non-determinism Relates to Verifiable ProofsWhat Is Asymptotic Analysis? And Why Does It Matter? A Deeper Understanding of Asymptotic Bounding.NP-Complete Explained (Cook-Levin Theorem)What Makes Mario NP-Hard? (Polynomial Reductions)Randomness is Random - Numberphile1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1What Is a Binary Heap?What exactly is an algorithm? Algorithms explained | BBC Ideas