视频选集 p0 1. Introduction to Algorithms p1 1.1 Priori Analysis and Posteriori Testing p2 1.2 Characteristics of Algorithm p3 1.3 How Write and Analyze Algorithm p4 1.4 Frequency Count Method p5 1.5.1 Time Complexity #1 p6 1.5.2 Time Complexity Example #2 p7 1.5.3 Time Complexity of While and if #3 p8 1.6 Classes of functions p9 1.7 Compare Class of Functions p10 1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1 p11 1.8.2 Asymptotic Notations - Big Oh - Omega - Theta #2 p12 1.9 Properties of Asymptotic Notations p13 1.10.1 Comparison of Functions #1 p14 1.10.2 Comparison of Functions #2 p15 1.11 Best Worst and Average Case Analysis p16 1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find p17 2 Divide And Conquer p18 2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1 p19 2.1.2 Recurrence Relation (T(n)= T(n-1) + n) #2 p20 2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3 p21 2.1.4 Recurrence Relation T(n)=2 T(n-1)+1 #4 p22 2.2 Masters Theorem Decreasing Function p23 2.3.1 Recurrence Relation Dividing Function T(n)=T(n⧸2)+1 #1 p24 2.3.2 Recurrence Relation Dividing [ T(n)=T(n⧸2)+ n]. #2 p25 2.3.3 Recurrence Relation [ T(n)= 2T(n⧸2) +n] #3 p26 2.4.1 Masters Theorem in Algorithms for Dividing Function #1 p27 2.4.2 Examples for Master Theorem #2 p28 2.5 Root function (Recurrence Relation) p29 2.6.1 Binary Search Iterative Method p30 2.6.2 Binary Search Recursive Method p31 2.6.3 Heap - Heap Sort - Heapify - Priority Queues p32 2.7.1 Two Way MergeSort - Iterative method p33 2.7.2. Merge Sort Algorithm p34 2.7.3 MergeSort in-depth Analysis p35 2.8.1 QuickSort Algorithm p36 2.8.2 QuickSort Analysis p37 2.9 Strassens Matrix Multiplication p38 3. Greedy Method - Introduction p39 3.1 Knapsack Problem - Greedy Method p40 3.2 Job Sequencing with Deadlines - Greedy Method p41 3.3 Optimal Merge Pattern - Greedy Method p42 3.4 Huffman Coding - Greedy Method p43 3.5 Prims and Kruskals Algorithms - Greedy Method p44 3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method p45 4 Principle of Optimality - Dynamic Programming introduction p46 4.1 MultiStage Graph - Dynamic Programming p47 4.1.1 MultiStage Graph (Program) - Dynamic Programming p48 4.2 All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming p49 4.3 Matrix Chain Multiplication - Dynamic Programming p50 [New] Matrix Chain Multiplication using Dynamic Programming Formula p51 4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming p52 4.4 Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programmi p53 4.5 0⧸1 Knapsack - Two Methods - Dynamic Programming p54 4.5.1 0⧸1 Knapsack Problem (Program) - Dynamic Programming p55 4.6 Optimal Binary Search Tree (Successful Search Only) - Dynamic Programmin p56 4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probabili p57 4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula p58 4.8 Reliability Design - Dynamic Programming p59 4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming p60 5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Searc p61 5.2 Articulation Point and Biconnected Components p62 6 Introduction to Backtracking - Brute Force Approach p63 6.1 N Queens Problem using Backtracking p64 6.2 Sum Of Subsets Problem - Backtracking p65 6.3 Graph Coloring Problem - Backtracking p66 6.4 Hamiltonian Cycle - Backtracking p67 7 Branch and Bound Introduction p68 7.1 Job Sequencing with Deadline - Branch and Bound p69 7.2 0⧸1 Knapsack using Branch and Bound p70 7.3 Traveling Salesman Problem - Branch and Bound p71 8. NP-Hard and NP-Complete Problems p72 8.1 NP-Hard Graph Problem - Clique Decision Problem p73 9.1 Knuth-Morris-Pratt KMP String Matching Algorithm p74 9.2 Rabin-Karp String Matching Algorithm p75 10.1 AVL Tree - Insertion and Rotations p76 10.2 B Trees and B+ Trees. How they are useful in Databases p77 Asymptotic Notations - Simplified p78 Hashing Technique - Simplified p79 Shortest Path Algorithms (Dijkstra and Bellman-Ford) - Simplified p80 BFS DFS - Simplified p81 Tower of Hanoi Problem - Made Easy p82 Row-Major and Column-Major Mapping p83 Merge Sort Algorithm - Hindi
加加zero的视频 【精译⚡算法导论】AbdulBari 杜克大学【中英⚡人体生理学入门|Introductory Human Physiology】 【计算机体系结构 CS61C 2022】伯克利—中英字幕 加州大学伯克利分校【中英⚡机器学习导论|CS189 2025 Introduction to Machine Learning】 【概率论进阶课 IMPA】 拉扎维【中英⚡电子电路I Electronics Circuits I】 【面向对象编程 by Mosh】 NinjaNerd系列【中英⚡肾脏医学|Renal Medicine】 【精译⚡从零开始构建 GPT 系列】Andrej Karpathy 德州大学奥斯汀分校【精译⚡数据分析和地质统计 Data Analytics And Geostatistics PGE337 2021】 【深度强化学习 CS285 2023】伯克利—中英字幕
![p24 2.3.2 Recurrence Relation Dividing [ T(n)=T(n⧸2)+ n]. #2](http://i1.hdslb.com/bfs/storyff/n250203sa1cbpwb5wwwdn32cnexiqz8f_firsti.jpg)
![p25 2.3.3 Recurrence Relation [ T(n)= 2T(n⧸2) +n] #3](http://i0.hdslb.com/bfs/storyff/n250203sa1vn3uk2r40imf2ek88wqm2k_firsti.jpg)
![p50 [New] Matrix Chain Multiplication using Dynamic Programming Formula](http://i1.hdslb.com/bfs/storyff/n250203sa2aqrnkuvjgf693b1zjupkyl_firsti.jpg)
![p56 4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probabili](http://i1.hdslb.com/bfs/storyff/n250203sa24d3etlm230a83524cogsdl_firsti.jpg)
![p57 4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula](http://i1.hdslb.com/bfs/storyff/n250203sa2mkrllmgq8dz7333mij7skv_firsti.jpg)
