Big O Notation for Algorithms in plain English

1. Introduction/1. Introduction Big O Notation Part 1.mp4

1. Introduction/3. Introduction Big O Notation Part 2.mp4

3. Quadratic Complexity Functional Class/3. Closest Points Brute Force Analysis.mp4

6. Logarithmic Complexity Functional Class/1. Introduction to Logarithms.mp4

7. Log Linear Complexity Functional Class/3. How scalable is a Log Linear algorithm.mp4

2. Linear Complexity Functional Class/1. What does it look like to scale linearly.mp4

3. Quadratic Complexity Functional Class/1. Understanding the Quadratic Runtime.mp4

6. Logarithmic Complexity Functional Class/2. Binary Search Algorithm.mp4

1. Introduction/4. Understanding Scalability.mp4

6. Logarithmic Complexity Functional Class/3. Why is Binary Search Logarithmic.mp4

3. Quadratic Complexity Functional Class/4. Optimizing Closest Points Brute Force.mp4

4. Constant Complexity Functional Class/1. Introduction to Constant Runtime Algorithms.mp4

5. Exponential Complexity Functional Class/1. How fast is Exponential Growth.mp4

3. Quadratic Complexity Functional Class/2. Closest Points Brute Force Algorithm.mp4

4. Constant Complexity Functional Class/3. Improving Algorithm and Analysis.mp4

2. Linear Complexity Functional Class/3. String Equals Algorithm.mp4

5. Exponential Complexity Functional Class/2. Subset Sum Problem Explained.mp4

4. Constant Complexity Functional Class/2. Number of Edges in a Graph Algorithm.mp4

5. Exponential Complexity Functional Class/3. Subset Sum Implementation and Analysis.mp4

7. Log Linear Complexity Functional Class/2. Building the Merge Sort.mp4

7. Log Linear Complexity Functional Class/1. Understanding Log Linear Complexity Functional Class.mp4

2. Linear Complexity Functional Class/2. Finding Minimum Algorithm.mp4

BigONotationInPlainEnglish-main.zip

6. Logarithmic Complexity Functional Class/2. Binary Search Algorithm.srt

3. Quadratic Complexity Functional Class/2. Closest Points Brute Force Algorithm.srt

6. Logarithmic Complexity Functional Class/3. Why is Binary Search Logarithmic.srt

5. Exponential Complexity Functional Class/2. Subset Sum Problem Explained.srt

3. Quadratic Complexity Functional Class/4. Optimizing Closest Points Brute Force.srt

1. Introduction/4. Understanding Scalability.srt

2. Linear Complexity Functional Class/3. String Equals Algorithm.srt

4. Constant Complexity Functional Class/3. Improving Algorithm and Analysis.srt

4. Constant Complexity Functional Class/2. Number of Edges in a Graph Algorithm.srt

3. Quadratic Complexity Functional Class/3. Closest Points Brute Force Analysis.srt

1. Introduction/1. Introduction Big O Notation Part 1.srt

7. Log Linear Complexity Functional Class/3. How scalable is a Log Linear algorithm.srt

5. Exponential Complexity Functional Class/1. How fast is Exponential Growth.srt

7. Log Linear Complexity Functional Class/1. Understanding Log Linear Complexity Functional Class.srt

2. Linear Complexity Functional Class/2. Finding Minimum Algorithm.srt

3. Quadratic Complexity Functional Class/1. Understanding the Quadratic Runtime.srt

7. Log Linear Complexity Functional Class/2. Building the Merge Sort.srt

6. Logarithmic Complexity Functional Class/1. Introduction to Logarithms.srt

5. Exponential Complexity Functional Class/3. Subset Sum Implementation and Analysis.srt

1. Introduction/3. Introduction Big O Notation Part 2.srt

2. Linear Complexity Functional Class/1. What does it look like to scale linearly.srt

4. Constant Complexity Functional Class/1. Introduction to Constant Runtime Algorithms.srt

1. Introduction/5. Useful pointers for this course.html

1. Introduction/2. Cracking an A to Z padlock.html