Aula #1 - 1 1 Why Study Algorithms 4 min
Aula #2 - 1 2 Integer Multiplication 9 min
Aula #3 - 1 3 Karatsuba Multiplication 13 min
Aula #4 - 1 4 About the Course 17 min
Aula #5 - 1 5 Merge Sort Motivation and Example 9 min
Aula #6 - 1 6 Merge Sort Pseudocode 13 min
Aula #7 - 1 7 Merge Sort Analysis 9 min
Aula #8 - 1 8 Guiding Principles for Analysis of Algorithms 15 min
Aula #9 - 2 1 The Gist 14 min
Aula #10 - 2 2 Big Oh Notation 4 min
Aula #11 - 2 3 Basic Examples 7 min
Aula #12 - 2 4 Big Omega and Theta 7 min
Aula #13 - 2 5 Additional Examples Review Optional 8 min
Aula #14 - 3 1 On log n Algorithm for Counting Inversions I 13 min
Aula #15 - 3 2 On log n Algorithm for Counting Inversions II 17 min
Aula #16 - 3 3 Strassen 's Subcubic Matrix Multiplication Algorithm 22 min
Aula #17 - 3 4 On log n Algorithm for Closest Pair I Advanced Optional 32 min
Aula #18 - 3 5 On log n Algorithm for Closest Pair II Advanced Optional 19 min
Aula #19 - 4 1 Motivation 8 min
Aula #20 - 4 2 Formal Statement 10 min
Aula #21 - 4 3 Examples 13 min
Aula #22 - 4 4 Proof I 10 min
Aula #23 - 4 5 Interpretation of the 3 Cases 11 min
Aula #24 - 4 6 Proof II 16 min
Aula #25 - 5 1 Quicksort Overview 12 min
Aula #26 - 5 2 Partitioning Around a Pivot 25 min
Aula #27 - 5 3 Correctness of Quicksort Review Optional 11 min
Aula #28 - 5 4 Choosing a Good Pivot 22min
Aula #29 - 6 1 Analysis I A Decomposition Principle Advanced Optional 22 min
Aula #30 - 6 2 Analysis II The Key Insight Advanced Optional 12min
Aula #31 - 6 3 Analysis III Final Calculations Advanced Optional 9min
Aula #32 - 7 1 Part I Review Optional 25 min
Aula #33 - 7 2 Part II Review Optional 17 min
Aula #34 - 8 1 Randomized Selection Algorithm 22 min
Aula #35 - 8 2 Randomized Selection Analysis 21 min
Aula #36 - 8 3 Deterministic Selection Algorithm Advanced Optional 17 min
Aula #37 - 8 4 Deterministic Selection Analysis I Advanced Optional 22 min
Aula #38 - 8 5 Deterministic Selection Analysis II Advanced Optional 13 min
Aula #39 - 8 6 Omegan log n Lower Bound for Comparison Based Sorting Advanced Optional 13 min
Aula #40 - 9 1 Graphs and Minimum Cuts 16 min
Aula #41 - 9 2 Graph Representations 14 min
Aula #42 - 9 3 Random Contraction Algorithm 9 min
Aula #43 - 9 4 Analysis of Contraction Algorithm 30 min
Aula #44 - 9 5 Counting Minimum Cuts 7 min
Aula #45 - 10 1 Graph Search Overview 23 min
Aula #46 - 10 2 Breadth First Search BFS The Basics 14 min
Aula #47 - 10 3 BFS and Shortest Paths 8 min
Aula #48 - 10 4 BFS and Undirected Connectivity 13 min
Aula #49 - 10 5 Depth First Search DFS The Basics 7 min
Aula #50 - 10 6 Topological Sort 22 min
Aula #51 - 10 7 Computing Strong Components The Algorithm 29 min
Aula #52 - 10 8 Computing Strong Components The Analysis 26 min
Aula #53 - 10 9 Structure of the Web Optional 19 min
Aula #54 - 11 1 Dijkstra 's Shortest Path Algorithm 21 min
Aula #55 - 11 2 Dijkstra 's Algorithm Examples 13 min
Aula #56 - 11 3 Correctness of Dijkstra 's Algorithm Advanced Optional 19 min
Aula #57 - 11 4 Dijkstra 's Algorithm Implementation and Running Time 26 min
Aula #58 - 12 1 Data Structures Overview 5 min
Aula #59 - 12 2 Heaps Operations and Applications 18 min
Aula #60 - 12 3 Heaps Implementation Details Advanced Optional 21 min
Aula #61 - 13 1 Balanced Search Trees Operations and Applications 11 min
Aula #62 - 13 2 Binary Search Tree Basics, Part I 13 min
Aula #63 - 13 3 Binary Search Tree Basics, Part II 30 min
Aula #64 - 13 4 Red Black Trees 21 min
Aula #65 - 13 5 Rotations Advanced Optional 8 min
Aula #66 - 13 6 Insertion in a Red Black Tree Advanced 15 min
Aula #67 - 14 1 Hash Tables Operations and Applications 19 min
Aula #68 - 14 2 Hash Tables Implementation Details, Part I 19 min
Aula #69 - 14 3 Hash Tables Implementation Details, Part II 22 min
Aula #70 - 15 1 Pathological Data Sets and Universal Hashing Motivation 22 min
Aula #71 - 15 2 Universal Hashing Definition and Example Advanced Optional 26 min
Aula #72 - 15 3 Universal Hashing Analysis of Chaining Advanced Optional 19 min
Aula #73 - 15 4 Hash Table Performance with Open Addressing Advanced Optional 16 min
Aula #74 - 16 1 Bloom Filters The Basics 16 min
Aula #75 - 16 2 Bloom Filters Heuristic Analysis 13 min
Complete course
with certificate!
On completion of this course, you can purchase a separate digital certificate for download at a cost of $ 3,74
Increase your chances of being hired by qualifying your skills with certificates.
Creating a class flash text
Creating a class flash video
