|
Обратите внимание, что наш сайт не размещает какие-либо файлы из списка. Вы не можете скачать
эти файлы или скачать torrent-файл.
|
| _README.txt |
6.11Кб |
| 10 - 1 - Regular Expressions (20_03).mp4 |
30.83Мб |
| 10 - 1 - Regular Expressions (20_03).srt |
22.83Кб |
| 10 - 2 - REs and NFAs (13_14).mp4 |
19.06Мб |
| 10 - 2 - REs and NFAs (13_14).srt |
15.29Кб |
| 10 - 3 - NFA Simulation (18_27).mp4 |
23.88Мб |
| 10 - 3 - NFA Simulation (18_27).srt |
19.82Кб |
| 10 - 4 - NFA Construction (11_42).mp4 |
16.56Мб |
| 10 - 4 - NFA Construction (11_42).srt |
12.34Кб |
| 10 - 5 - Regular Expression Applications (20_09).mp4 |
33.80Мб |
| 10 - 5 - Regular Expression Applications (20_09).srt |
21.62Кб |
| 11 - 1 - Introduction to Data Compression (22_27).mp4 |
36.04Мб |
| 11 - 1 - Introduction to Data Compression (22_27).srt |
25.48Кб |
| 11 - 2 - Run-Length Coding (5_59).mp4 |
9.11Мб |
| 11 - 2 - Run-Length Coding (5_59).srt |
6.34Кб |
| 11 - 3 - Huffman Compression (24_14).mp4 |
34.02Мб |
| 11 - 3 - Huffman Compression (24_14).srt |
26.39Кб |
| 11 - 4 - LZW Compression (27_33).mp4 |
37.15Мб |
| 11 - 4 - LZW Compression (27_33).srt |
27.74Кб |
| 1 - 1 - Course Introduction (9_22).mp4 |
15.60Мб |
| 1 - 1 - Course Introduction (9_22).srt |
12.82Кб |
| 12 - 1 - Introduction to Reductions (9_25).mp4 |
17.45Мб |
| 12 - 1 - Introduction to Reductions (9_25).srt |
11.84Кб |
| 12 - 2 - Designing Algorithms (8_13).mp4 |
11.87Мб |
| 12 - 2 - Designing Algorithms (8_13).srt |
9.46Кб |
| 12 - 3 - Establishing Lower Bounds (9_16).mp4 |
16.45Мб |
| 12 - 3 - Establishing Lower Bounds (9_16).srt |
10.56Кб |
| 12 - 4 - Classifying Problems (12_45).mp4 |
18.52Мб |
| 12 - 4 - Classifying Problems (12_45).srt |
14.04Кб |
| 13 - 1 - Brewer's Problem (21_15).mp4 |
30.55Мб |
| 13 - 1 - Brewer's Problem (21_15).srt |
22.97Кб |
| 13 - 2 - Simplex Algorithm (11_49).mp4 |
16.12Мб |
| 13 - 2 - Simplex Algorithm (11_49).srt |
11.79Кб |
| 13 - 3 - Simplex Implementations (16_21).mp4 |
30.05Мб |
| 13 - 3 - Simplex Implementations (16_21).srt |
17.93Кб |
| 13 - 4 - Linear Programming Reductions (11_46).mp4 |
20.79Мб |
| 13 - 4 - Linear Programming Reductions (11_46).srt |
13.21Кб |
| 14 - 1 - Introduction to Intractability (17_00).mp4 |
34.49Мб |
| 14 - 1 - Introduction to Intractability (17_00).srt |
19.89Кб |
| 14 - 2 - Search Problems (10_56).mp4 |
21.23Мб |
| 14 - 2 - Search Problems (10_56).srt |
12.67Кб |
| 14 - 3 - P vs. NP (16_29).mp4 |
29.95Мб |
| 14 - 3 - P vs. NP (16_29).srt |
18.07Кб |
| 14 - 4 - Classifying Problems (13_43).mp4 |
21.37Мб |
| 14 - 4 - Classifying Problems (13_43).srt |
14.54Кб |
| 14 - 5 - NP-Completeness (12_38).mp4 |
31.80Мб |
| 14 - 5 - NP-Completeness (12_38).srt |
13.88Кб |
| 14 - 6 - Coping with Intractability (14_01).mp4 |
21.66Мб |
| 14 - 6 - Coping with Intractability (14_01).srt |
14.02Кб |
| 2 - 1 - Introduction to Graphs (9_32).mp4 |
14.57Мб |
| 2 - 1 - Introduction to Graphs (9_32).srt |
11.46Кб |
| 2 - 2 - Graph API (14_47).mp4 |
20.58Мб |
| 2 - 2 - Graph API (14_47).srt |
16.47Кб |
| 2 - 3 - Depth-First Search (26_22).mp4 |
36.97Мб |
| 2 - 3 - Depth-First Search (26_22).srt |
31.03Кб |
| 2 - 4 - Breadth-First Search (13_34).mp4 |
19.07Мб |
| 2 - 4 - Breadth-First Search (13_34).srt |
15.71Кб |
| 2 - 5 - Connected Components (18_56).mp4 |
24.75Мб |
| 2 - 5 - Connected Components (18_56).srt |
22.39Кб |
| 2 - 6 - Graph Challenges (14_29).mp4 |
24.32Мб |
| 2 - 6 - Graph Challenges (14_29).srt |
16.89Кб |
| 3 - 1 - Introduction to Digraphs (8_30).mp4 |
13.31Мб |
| 3 - 1 - Introduction to Digraphs (8_30).srt |
10.30Кб |
| 3 - 2 - Digraph API (4_56).mp4 |
7.21Мб |
| 3 - 2 - Digraph API (4_56).srt |
5.27Кб |
| 3 - 3 - Digraph Search (20_56).mp4 |
27.59Мб |
| 3 - 3 - Digraph Search (20_56).srt |
22.38Кб |
| 3 - 4 - Topological Sort (12_54).mp4 |
16.88Мб |
| 3 - 4 - Topological Sort (12_54).srt |
14.64Кб |
| 3 - 5 - Strong Components (20_22).mp4 |
26.06Мб |
| 3 - 5 - Strong Components (20_22).srt |
23.83Кб |
| 4 - 1 - Introduction to MSTs (4_04).mp4 |
6.76Мб |
| 4 - 1 - Introduction to MSTs (4_04).srt |
4.37Кб |
| 4 - 2 - Greedy Algorithm (12_56).mp4 |
18.29Мб |
| 4 - 2 - Greedy Algorithm (12_56).srt |
15.87Кб |
| 4 - 3 - Edge-Weighted Graph API (11_15).mp4 |
15.12Мб |
| 4 - 3 - Edge-Weighted Graph API (11_15).srt |
11.83Кб |
| 4 - 4 - Kruskal's Algorithm (12_28).mp4 |
16.87Мб |
| 4 - 4 - Kruskal's Algorithm (12_28).srt |
13.98Кб |
| 4 - 5 - Prim's Algorithm (33_15).mp4 |
42.28Мб |
| 4 - 5 - Prim's Algorithm (33_15).srt |
38.98Кб |
| 4 - 6 - MST Context (10_34).mp4 |
16.42Мб |
| 4 - 6 - MST Context (10_34).srt |
11.56Кб |
| 5 - 1 - Shortest Paths APIs (10_51).mp4 |
15.67Мб |
| 5 - 1 - Shortest Paths APIs (10_51).srt |
13.15Кб |
| 5 - 2 - Shortest Path Properties (14_46).mp4 |
19.77Мб |
| 5 - 2 - Shortest Path Properties (14_46).srt |
15.94Кб |
| 5 - 3 - Dijkstra's Algorithm (18_58).mp4 |
28.09Мб |
| 5 - 3 - Dijkstra's Algorithm (18_58).srt |
22.51Кб |
| 5 - 4 - Edge-Weighted DAGs (19_23).mp4 |
26.49Мб |
| 5 - 4 - Edge-Weighted DAGs (19_23).srt |
22.87Кб |
| 5 - 5 - Negative Weights (21_01).mp4 |
27.84Мб |
| 5 - 5 - Negative Weights (21_01).srt |
23.88Кб |
| 6 - 1 - Introduction to Maxflow (10_33).mp4 |
14.99Мб |
| 6 - 1 - Introduction to Maxflow (10_33).srt |
12.99Кб |
| 6 - 2 - Ford-Fulkerson Algorithm (6_32).mp4 |
8.51Мб |
| 6 - 2 - Ford-Fulkerson Algorithm (6_32).srt |
7.56Кб |
| 6 - 3 - Maxflow-Mincut Theorem (9_38).mp4 |
12.78Мб |
| 6 - 3 - Maxflow-Mincut Theorem (9_38).srt |
10.95Кб |
| 6 - 4 - Running Time Analysis (8_49).mp4 |
12.67Мб |
| 6 - 4 - Running Time Analysis (8_49).srt |
9.89Кб |
| 6 - 5 - Java Implementation (14_29).mp4 |
19.15Мб |
| 6 - 5 - Java Implementation (14_29).srt |
16.21Кб |
| 6 - 6 - Maxflow Applications (22_20).mp4 |
33.91Мб |
| 6 - 6 - Maxflow Applications (22_20).srt |
25.52Кб |
| 7 - 1 - Strings in Java (17_43).mp4 |
25.38Мб |
| 7 - 1 - Strings in Java (17_43).srt |
21.35Кб |
| 7 - 2 - Key-Indexed Counting (12_06).mp4 |
16.76Мб |
| 7 - 2 - Key-Indexed Counting (12_06).srt |
12.97Кб |
| 7 - 3 - LSD Radix Sort (15_00).mp4 |
27.68Мб |
| 7 - 3 - LSD Radix Sort (15_00).srt |
17.74Кб |
| 7 - 4 - MSD Radix Sort (13_41).mp4 |
19.04Мб |
| 7 - 4 - MSD Radix Sort (13_41).srt |
15.82Кб |
| 7 - 5 - 3-way Radix Quicksort (7_22).mp4 |
11.91Мб |
| 7 - 5 - 3-way Radix Quicksort (7_22).srt |
8.23Кб |
| 7 - 6 - Suffix Arrays (19_25).mp4 |
29.63Мб |
| 7 - 6 - Suffix Arrays (19_25).srt |
22.50Кб |
| 8 - 1 - R-way Tries (32_19).mp4 |
40.89Мб |
| 8 - 1 - R-way Tries (32_19).srt |
37.97Кб |
| 8 - 2 - Ternary Search Tries (22_42).mp4 |
29.27Мб |
| 8 - 2 - Ternary Search Tries (22_42).srt |
25.74Кб |
| 8 - 3 - Character-Based Operations (20_03).mp4 |
32.72Мб |
| 8 - 3 - Character-Based Operations (20_03).srt |
21.59Кб |
| 9 - 1 - Introduction to Substring Search (6_42).mp4 |
9.04Мб |
| 9 - 1 - Introduction to Substring Search (6_42).srt |
7.69Кб |
| 9 - 2 - Brute-Force Substring Search (10_11).mp4 |
14.13Мб |
| 9 - 2 - Brute-Force Substring Search (10_11).srt |
11.73Кб |
| 9 - 3 - Knuth-Morris-Pratt (33_14).mp4 |
45.04Мб |
| 9 - 3 - Knuth-Morris-Pratt (33_14).srt |
38.17Кб |
| 9 - 4 - Boyer-Moore (8_36).mp4 |
12.01Мб |
| 9 - 4 - Boyer-Moore (8_36).srt |
9.71Кб |
| 9 - 5 - Rabin-Karp (16_13).mp4 |
24.58Мб |
| 9 - 5 - Rabin-Karp (16_13).srt |
16.94Кб |