Algorithms Explained: Computational Complexity

Algorithms Explained: Computational Complexity

Channel:
United States DataDaft
Subscribers:
43,700
Published on ● Video Link: https://www.youtube.com/watch?v=47GRtdHOKMg


Duration: 21:23
20,427 views
732

An overview of computational complexity including the basics of big O notation and common time complexities with examples of each.

Understanding computational complexity is vital to understanding algorithms and why certain constructions or implementations are better than others. Even if you don't implement algorithms yourself, an understanding of computational complexity can help you better apply the tools you use.



Other Videos By DataDaft


2021-04-08Python Programming Practice: LeetCode #17 -- Letter Combinations of a Phone Number
2021-04-07Python Programming Practice: LeetCode #13 -- Roman to Integer
2021-04-05Python Programming Practice: LeetCode #69 Sqrt(x)
2021-04-02Python Programming Practice: LeetCode #66 -- Plus One
2021-04-01Python Programming Practice: LeetCode #58 -- Length of Last Word
2021-03-26How To Get Absolute Values in Python
2021-03-25How To Use all() and any() in Python
2021-03-24How To Use zip() in Python
2021-03-24How To Use map() in Python
2021-03-18Algorithms Explained: Memory Complexity
2021-03-12Algorithms Explained: Computational Complexity
2021-03-11Algorithms Explained: What is an Algorithm?
2021-02-26Tallest Buildings In History To Scale (1 pixel = 1 meter)
2021-02-12Introduction to R: Random Forests
2021-02-12Introduction to R: Decision Trees
2021-02-05Introduction to R: Logistic Regression
2021-02-04Introduction to R: Linear Regression
2021-02-03Introduction to R: ANOVA
2021-02-02Introduction to R: Chi-Squared Tests
2021-02-01Introduction to R: T-Tests (Hypothesis Testing)
2021-01-29Introduction to R: Confidence Intervals


Tags:
Computational Complexity
algorithm complexity
algorithm run time
time complexity
big O notation
big O
function complexity
linear complexity
loglinear complexity
exponential run time
exponential complexity
O(nlogn)
O(n)
O(2^n)
O(n^2)
O(logn)
polynomial complexity
constant runtime
quadratic run time
algorithm running time
algorithm efficiency
computational efficiency
algorithm speed
memory complexity
theory of computing
O(1)
O(n!)