-
Урок 1.
00:00:59
Welcome to the Course!
-
Урок 2.
00:06:43
What & Why
-
Урок 3.
00:09:32
Measuring Algorithm Performance & Time Complexity
-
Урок 4.
00:06:58
Big O Notation
-
Урок 5.
00:11:28
Deriving the Time Complexity / Big O of an Algorithm
-
Урок 6.
00:04:51
Constant Time
-
Урок 7.
00:03:43
Using Big O For Algorithm Comparison
-
Урок 8.
00:02:14
A First Task!
-
Урок 9.
00:10:02
Solution & A Gotcha
-
Урок 10.
00:05:31
About this Course & Outline
-
Урок 11.
00:01:39
Module Introduction
-
Урок 12.
00:03:31
The Fibonacci Problem
-
Урок 13.
00:05:43
The Fibonacci Solution
-
Урок 14.
00:04:18
Fibonacci Big O (Time Complexity)
-
Урок 15.
00:02:34
The "Is Prime" Problem
-
Урок 16.
00:03:57
The "Is Prime" Solution
-
Урок 17.
00:12:49
"Is Prime", Big O & Multiple Cases
-
Урок 18.
00:06:45
"Is Prime" - Improved Version
-
Урок 19.
00:01:28
Time to Practice (Problem)
-
Урок 20.
00:12:51
Time to Practice (Solution)
-
Урок 21.
00:05:54
Identifying Big O Quickly
-
Урок 22.
00:08:07
Is Power Of Two Algorithm
-
Урок 23.
00:07:30
Logarithmic Time Complexity
-
Урок 24.
00:08:20
Bitwise Operators & Power Of Two
-
Урок 25.
00:02:51
Again: Identifying Big O Quickly
-
Урок 26.
00:05:13
The Factorial Algorithm
-
Урок 27.
00:01:07
Module Introduction
-
Урок 28.
00:08:31
Recursion in Algorithms
-
Урок 29.
00:11:31
Exponential Time Complexity
-
Урок 30.
00:05:09
Quadratic Time Complexity vs Exponential Time Complexity
-
Урок 31.
00:03:27
What is "Dynamic Programming"?
-
Урок 32.
00:09:23
"Dynamic Programming" in Action
-
Урок 33.
00:04:38
The "Bottom Up" Approach
-
Урок 34.
00:02:05
Module Introduction
-
Урок 35.
00:01:20
What Search Algorithms Are About
-
Урок 36.
00:01:42
Introducing Linear Search
-
Урок 37.
00:10:40
Linear Search in Action
-
Урок 38.
00:04:22
Linear Search Time Complexity
-
Урок 39.
00:02:51
Binary Search in Theory
-
Урок 40.
00:11:47
Binary Search in Action
-
Урок 41.
00:03:21
Binary Search Time Complexity
-
Урок 42.
00:13:06
Recursive Binary Search
-
Урок 43.
00:10:40
The Master Theorem
-
Урок 44.
00:00:53
Module Introduction
-
Урок 45.
00:01:12
What are Sorting Algorithms About?
-
Урок 46.
00:05:08
Bubble Sort - Theory
-
Урок 47.
00:17:32
Bubble Sort in Action
-
Урок 48.
00:03:42
Bubble Sort Time Complexity
-
Урок 49.
00:02:56
Quicksort - Theory
-
Урок 50.
00:13:15
Quicksort in Action
-
Урок 51.
00:08:05
Quicksort Time Complexity
-
Урок 52.
00:04:10
Merge Sort - Theory
-
Урок 53.
00:16:39
Merge Sort in Action
-
Урок 54.
00:04:02
Merge Sort Time Complexity
-
Урок 55.
00:02:05
Summary
-
Урок 56.
00:01:14
Module Introduction
-
Урок 57.
00:03:03
Introducing Space Complexity
-
Урок 58.
00:02:40
Deriving Space Complexity
-
Урок 59.
00:05:07
Factorial Algorithm (Loop) - Space Complexity
-
Урок 60.
00:03:59
Factorial Algorithm (Recursive) - Space Complexity
-
Урок 61.
00:03:24
Linear Search - Space Complexity
-
Урок 62.
00:02:25
Binary Search - Space Complexity
-
Урок 63.
00:02:05
Bubble Sort - Space Complexity
-
Урок 64.
00:06:01
Quicksort - Space Complexity
-
Урок 65.
00:02:14
Merge Sort - Space Complexity
-
Урок 66.
00:01:51
Module Introduction
-
Урок 67.
00:03:18
An Introduction to Sets
-
Урок 68.
00:05:12
The Cartesian Product Algorithm
-
Урок 69.
00:05:11
Cartesian Product - Time Complexity
-
Урок 70.
00:16:38
The Cartesian Product Algorithm - Without Limits
-
Урок 71.
00:03:28
The Permutations Algorithms
-
Урок 72.
00:19:01
Permutations without Repetitions
-
Урок 73.
00:04:45
Understanding Permutations
-
Урок 74.
00:03:54
Permutations without Repetitions - Big O
-
Урок 75.
00:15:16
Permutations WITH Repetitions
-
Урок 76.
00:01:08
Module Introduction
-
Урок 77.
00:07:07
Solving Problems In A Structured Way
-
Урок 78.
00:04:01
Simplifying Problems
-
Урок 79.
00:01:36
Practice Makes Perfect!
-
Урок 80.
00:01:48
The Knapsack Problem (0/1)
-
Урок 81.
00:05:22
A Wrong Approach
-
Урок 82.
00:05:27
Approaching the Problem Differently
-
Урок 83.
00:18:22
A Working Knapsack Solution
-
Урок 84.
00:14:48
An Improved Knapsack Algorithm
-
Урок 85.
00:03:49
Greedy vs Dynamic Algorithms
-
Урок 86.
00:09:47
A Greedy Knapsack Algorithm
-
Урок 87.
00:02:51
A New Problem Solving Plan
-
Урок 88.
00:03:32
The Change Making Problem
-
Урок 89.
00:12:41
A Greedy Change Making Algorithm
-
Урок 90.
00:13:18
A Variation to the Change Making Problem
-
Урок 91.
00:06:24
Course Roundup