|
RAR-files |
| p-9780133798821.rar |
100,000,000 |
6FC9DBDF |
| p-9780133798821.r00 |
100,000,000 |
F4BCE879 |
| p-9780133798821.r01 |
100,000,000 |
8396EB78 |
| p-9780133798821.r02 |
100,000,000 |
851A62E6 |
| p-9780133798821.r03 |
100,000,000 |
67F20F0E |
| p-9780133798821.r04 |
100,000,000 |
47872678 |
| p-9780133798821.r05 |
100,000,000 |
81964E08 |
| p-9780133798821.r06 |
100,000,000 |
CD50AECF |
| p-9780133798821.r07 |
100,000,000 |
8E2A849D |
| p-9780133798821.r08 |
100,000,000 |
3AEABE56 |
| p-9780133798821.r09 |
100,000,000 |
A0CFCA0E |
| p-9780133798821.r10 |
100,000,000 |
5638140F |
| p-9780133798821.r11 |
100,000,000 |
F2FFF896 |
| p-9780133798821.r12 |
100,000,000 |
7027DC4B |
| p-9780133798821.r13 |
100,000,000 |
02659DDF |
| p-9780133798821.r14 |
100,000,000 |
23C8C4D6 |
| p-9780133798821.r15 |
100,000,000 |
4806BD12 |
| p-9780133798821.r16 |
100,000,000 |
0AA20431 |
| p-9780133798821.r17 |
100,000,000 |
454CDBF4 |
| p-9780133798821.r18 |
100,000,000 |
87C0B293 |
| p-9780133798821.r19 |
100,000,000 |
EC4D0E49 |
| p-9780133798821.r20 |
100,000,000 |
A5CF8AE3 |
| p-9780133798821.r21 |
100,000,000 |
456648B3 |
| p-9780133798821.r22 |
100,000,000 |
C575A5AA |
| p-9780133798821.r23 |
100,000,000 |
335FA856 |
| p-9780133798821.r24 |
100,000,000 |
EE13ACA2 |
| p-9780133798821.r25 |
100,000,000 |
7B544F01 |
| p-9780133798821.r26 |
100,000,000 |
84F2C839 |
| p-9780133798821.r27 |
100,000,000 |
6F215ED2 |
| p-9780133798821.r28 |
100,000,000 |
418D7F2A |
| p-9780133798821.r29 |
100,000,000 |
070DB772 |
| p-9780133798821.r30 |
100,000,000 |
9F703E17 |
| p-9780133798821.r31 |
100,000,000 |
42862003 |
| p-9780133798821.r32 |
100,000,000 |
5AC23EBD |
| p-9780133798821.r33 |
100,000,000 |
30B844D6 |
| p-9780133798821.r34 |
100,000,000 |
545765B1 |
| p-9780133798821.r35 |
100,000,000 |
779AC34C |
| p-9780133798821.r36 |
100,000,000 |
298BDAC8 |
| p-9780133798821.r37 |
100,000,000 |
1D06685C |
| p-9780133798821.r38 |
100,000,000 |
99182BEC |
| p-9780133798821.r39 |
100,000,000 |
75AF2D93 |
| p-9780133798821.r40 |
100,000,000 |
282C3158 |
| p-9780133798821.r41 |
100,000,000 |
09E5C6D4 |
| p-9780133798821.r42 |
100,000,000 |
5CD182E0 |
| p-9780133798821.r43 |
100,000,000 |
6659232D |
| p-9780133798821.r44 |
100,000,000 |
93B71F81 |
| p-9780133798821.r45 |
100,000,000 |
653998FA |
| p-9780133798821.r46 |
100,000,000 |
A202AD50 |
| p-9780133798821.r47 |
100,000,000 |
A5C48D40 |
| p-9780133798821.r48 |
100,000,000 |
A08FA3F3 |
| p-9780133798821.r49 |
100,000,000 |
DAC97D2A |
| p-9780133798821.r50 |
100,000,000 |
200407F6 |
| p-9780133798821.r51 |
100,000,000 |
1EA6772D |
| p-9780133798821.r52 |
100,000,000 |
A3047C45 |
| p-9780133798821.r53 |
100,000,000 |
A17FC481 |
| p-9780133798821.r54 |
100,000,000 |
2C8B43FC |
| p-9780133798821.r55 |
100,000,000 |
FE3A3DD3 |
| p-9780133798821.r56 |
100,000,000 |
665EDA22 |
| p-9780133798821.r57 |
100,000,000 |
EA997B9D |
| p-9780133798821.r58 |
100,000,000 |
4B17697B |
| p-9780133798821.r59 |
100,000,000 |
98E8C554 |
| p-9780133798821.r60 |
100,000,000 |
B0890920 |
| p-9780133798821.r61 |
100,000,000 |
7FA3B491 |
| p-9780133798821.r62 |
100,000,000 |
33CE0185 |
| p-9780133798821.r63 |
100,000,000 |
3C2FE3CC |
| p-9780133798821.r64 |
100,000,000 |
A1D138C2 |
| p-9780133798821.r65 |
27,038,803 |
601E1B94 |
|
| Total size: |
6,627,038,803 |
|
|
| Archived
files |
|
Bonus Lectures |
0 |
00000000 |
|
Bonus Lectures\13 - Classifying Problems.mp4
[4d068b5b47497ecf]
|
77,686,355 |
12347BDD |
|
Bonus Lectures\7 - Simplex Algorithm.mp4
[29b0346805874e06]
|
52,787,539 |
827386A2 |
|
Bonus Lectures\21 - Maxflow Applications.mp4
[bae67dd68f24bd6e]
|
115,286,433 |
0AB5A836 |
|
Bonus Lectures\18 - Maxflow-Mincut Theorem.mp4
[a2e595df8f8696e8]
|
40,224,473 |
12E3078C |
|
Bonus Lectures\8 - Simplex Implementations.mp4
[c81be25c3b77fb70]
|
122,641,439 |
191DE21A |
|
Bonus Lectures\20 - Java Implementation.mp4
[49bde42e27896de8]
|
60,601,568 |
336588FF |
|
Bonus Lectures\10 - Introduction to Intractability.mp4
[929f48d37b786e45]
|
181,154,429 |
2E9D8CB7 |
|
Bonus Lectures\22 - 1d Range Search.mp4
[f6fb5d2553c55ea2]
|
50,933,262 |
9C202B18 |
|
Bonus Lectures\17 - Ford-Fulkerson Algorithm.mp4
[dbb8454179fa0351]
|
27,710,052 |
DD31A823 |
|
Bonus Lectures\12 - P vs. NP.mp4
[acb7a65ea7bc9f02]
|
126,943,835 |
ABB9147B |
|
Bonus Lectures\23 - Line Segment Intersection.mp4
[3992adce5907618d]
|
34,544,937 |
668C7A5E |
|
Bonus Lectures\11 - Search Problems.mp4
[4a1c24169a198bdb]
|
104,879,473 |
FDF4A97F |
|
Bonus Lectures\14 - NP-Completeness.mp4
[3eb127f21c1c650]
|
140,791,926 |
D4ED04E0 |
|
Bonus Lectures\26 - Rectangle Intersection.mp4
[aa413a9844ea1016]
|
57,959,058 |
F436A025 |
|
Bonus Lectures\15 - Coping with Intractability.mp4
[3e6b51f27ba6ac31]
|
78,912,452 |
08695C51 |
|
Bonus Lectures\24 - Kd-Trees.mp4
[131646d0a7bd2c5]
|
241,626,162 |
CB8CBE0A |
|
Bonus Lectures\16 - Introduction to Maxflow.mp4
[ed93dd09c27378c0]
|
53,102,092 |
AC607018 |
|
Bonus Lectures\25 - Interval Search Trees.mp4
[ac3e566cafc19f32]
|
69,585,631 |
F3025673 |
|
Bonus Lectures\9 - Linear Programming Reductions.mp4
[f767e497346e27a9]
|
81,373,641 |
BCDF5D86 |
|
Bonus Lectures\19 - Running Time Analysis.mp4
[5e7f7d521a5f7306]
|
44,735,571 |
1CDABE4F |
|
Introduction |
0 |
00000000 |
|
Introduction\0 - Algorithms: Introduction.mp4
[5a147624842e3862]
|
104,319,201 |
B6013869 |
|
Section 1.3: Bags, Queues, and Stacks |
0 |
00000000 |
|
Section 1.3: Bags, Queues, and Stacks\0 - Stacks.mp4
[ece22bf97e89aa01]
|
156,480,580 |
C90A4541 |
|
Section 1.3: Bags, Queues, and Stacks\1 - Resizing Arrays.mp4
[544721e91ebcde2d]
|
97,801,614 |
3A05BEC0 |
|
Section 1.3: Bags, Queues, and Stacks\2 - Queues.mp4
[5558bafc59ea8b6]
|
51,682,999 |
DA51C1D6 |
|
Section 1.3: Bags, Queues, and Stacks\5 - Stack and Queue Applications.mp4
[59f7967fc632db24]
|
130,651,696 |
CEF867E9 |
|
Section 1.3: Bags, Queues, and Stacks\3 - Generics.mp4
[c7021458d2887381]
|
69,653,868 |
380C48FD |
|
Section 1.3: Bags, Queues, and Stacks\4 - Iterators.mp4
[ae4bdd3a4104b696]
|
88,338,048 |
1985994D |
|
Section 1.4: Analysis of Algorithms |
0 |
00000000 |
|
Section 1.4: Analysis of Algorithms\1 - Observations.mp4
[42801110b9840acc]
|
46,677,781 |
E62DDD1A |
|
Section 1.4: Analysis of Algorithms\3 - Order-of-Growth Classifications.mp4
[83d27a7ca3dc0d5c]
|
59,649,594 |
4FD91FF2 |
|
Section 1.4: Analysis of Algorithms\2 - Mathematical Models.mp4
[38f2a22022e86b5a]
|
68,783,453 |
DE5B76D3 |
|
Section 1.4: Analysis of Algorithms\4 - Theory of Algorithms.mp4
[7581c0eb4c731a2b]
|
74,030,414 |
A8650A8E |
|
Section 1.4: Analysis of Algorithms\5 - Memory.mp4
[d3165dadd69c4f3f]
|
43,853,973 |
C57E5B95 |
|
Section 1.4: Analysis of Algorithms\0 - Introduction to Analysis of Algorithms.mp4
[d0bf1a1e0967f8a1]
|
48,686,232 |
3B3A4D9E |
|
Section 1.5: Case Study: Union-Find |
0 |
00000000 |
|
Section 1.5: Case Study: Union-Find\2 - Quick Union.mp4
[3d87336158de3ad7]
|
56,923,179 |
524B137B |
|
Section 1.5: Case Study: Union-Find\0 - Dynamic Connectivity.mp4
[2cf57a6753f48a8c]
|
97,998,624 |
64A5C7A8 |
|
Section 1.5: Case Study: Union-Find\1 - Quick Find.mp4
[60091be1513b0696]
|
119,527,881 |
3D42A686 |
|
Section 1.5: Case Study: Union-Find\4 - Union-Find Applications.mp4
[3e684225a0d58fe9]
|
123,621,671 |
DEC05ED9 |
|
Section 1.5: Case Study: Union-Find\3 - Quick-Union Improvements.mp4
[5f8fb336fa9281f3]
|
147,175,895 |
7F0A44D3 |
|
Section 2.1: Elementary Sorts |
0 |
00000000 |
|
Section 2.1: Elementary Sorts\4 - Shuffling.mp4
[e60017fa27fc3f95]
|
39,765,726 |
EAD3AC5E |
|
Section 2.1: Elementary Sorts\1 - Selection Sort.mp4
[612be226d0cc37f0]
|
35,469,027 |
6D9FFE87 |
|
Section 2.1: Elementary Sorts\3 - Shellsort.mp4
[63ef658ed858bac1]
|
49,242,243 |
1216FB52 |
|
Section 2.1: Elementary Sorts\2 - Insertion Sort.mp4
[4c7f1dd544ef5b6a]
|
49,041,245 |
62297726 |
|
Section 2.1: Elementary Sorts\5 - Convex Hull.mp4
[71ca5879c78fd45b]
|
73,531,364 |
5C3D5919 |
|
Section 2.1: Elementary Sorts\0 - Introduction to Sorting.mp4
[af4e67f82a941d73]
|
67,057,041 |
3950F861 |
|
Section 2.2: Mergesort |
0 |
00000000 |
|
Section 2.2: Mergesort\2 - Sorting Complexity.mp4
[34cae7dc0bac3da]
|
49,400,340 |
4107E20B |
|
Section 2.2: Mergesort\4 - Stability.mp4
[d19e038c3f2d5d99]
|
30,844,828 |
A6296774 |
|
Section 2.2: Mergesort\1 - Bottom-up Mergesort.mp4
[f887230b325c8be3]
|
19,311,148 |
27C1EC05 |
|
Section 2.2: Mergesort\3 - Comparators.mp4
[3757357f5ee036af]
|
34,083,774 |
107B0C98 |
|
Section 2.2: Mergesort\0 - Mergesort.mp4
[abd0066b45639b13]
|
112,517,015 |
1A313CF6 |
|
Section 2.3: Quicksort |
0 |
00000000 |
|
Section 2.3: Quicksort\3 - System Sorts.mp4
[6c91cf0e54b4c495]
|
71,089,078 |
6F5F90A2 |
|
Section 2.3: Quicksort\1 - Selection.mp4
[d7d4c26133d0f2b2]
|
46,406,984 |
20A8C35C |
|
Section 2.3: Quicksort\2 - Duplicate Keys.mp4
[12caf569728fc4cd]
|
66,940,524 |
F649EA46 |
|
Section 2.3: Quicksort\0 - Quicksort.mp4
[54fc8717a277305f]
|
98,301,549 |
24895A57 |
|
Section 2.4: Priority Queues |
0 |
00000000 |
|
Section 2.4: Priority Queues\0 - APIs and Elementary Implementations.mp4
[d04bca71ce7e480c]
|
68,281,528 |
79D74A63 |
|
Section 2.4: Priority Queues\1 - Binary Heaps.mp4
[48127a5b933c0495]
|
110,525,058 |
69DA36ED |
|
Section 2.4: Priority Queues\2 - Heapsort.mp4
[e4d822dacd692ce7]
|
68,586,228 |
3C8C33A6 |
|
Section 3.1: Symbol Tables |
0 |
00000000 |
|
Section 3.1: Symbol Tables\0 - Symbol Table APIs.mp4
[73afef60c4041e9f]
|
115,187,228 |
08BE3D8F |
|
Section 3.1: Symbol Tables\1 - Elementary Implementations.mp4
[290f7fbf8e92b7c9]
|
44,245,235 |
F9EE2F6C |
|
Section 3.1: Symbol Tables\2 - Ordered Operations.mp4
[4faffe2516e59c64]
|
34,674,415 |
9E9AA4B3 |
|
Section 3.2: Binary Search Trees |
0 |
00000000 |
|
Section 3.2: Binary Search Trees\0 - Binary Search Trees.mp4
[f74a03163a6a3095]
|
90,860,843 |
1AE225F5 |
|
Section 3.2: Binary Search Trees\1 - Ordered Operations in BSTs.mp4
[15c03d9456e4d0c1]
|
44,765,334 |
A45549EA |
|
Section 3.2: Binary Search Trees\2 - Deletion in BSTs.mp4
[e16d9f9907af6626]
|
58,983,867 |
9CB4F9CC |
|
Section 3.3: Balanced Search Trees |
0 |
00000000 |
|
Section 3.3: Balanced Search Trees\1 - Red-Black BSTs.mp4
[d88f5e0e348c6aaa]
|
180,476,762 |
8BAF24A2 |
|
Section 3.3: Balanced Search Trees\0 - 2-3 Search Trees.mp4
[6b230084540778d]
|
88,695,035 |
5350CAC1 |
|
Section 3.4: Hash Tables |
0 |
00000000 |
|
Section 3.4: Hash Tables\0 - Hash Functions.mp4
[30317b151b3b47bc]
|
77,546,090 |
CF6708F9 |
|
Section 3.4: Hash Tables\2 - Linear Probing.mp4
[cda0ce3923c95205]
|
67,139,917 |
61EE4854 |
|
Section 3.4: Hash Tables\3 - Context.mp4
[3cd1002cade3a932]
|
48,786,201 |
359C28D2 |
|
Section 3.4: Hash Tables\1 - Separate Chaining.mp4
[7452e03f65e682c9]
|
34,200,803 |
5521A72B |
|
Section 3.5: Applications |
0 |
00000000 |
|
Section 3.5: Applications\2 - Indexing Clients.mp4
[7f9436ab2b1c00d0]
|
46,742,676 |
AEBA8198 |
|
Section 3.5: Applications\0 - Sets.mp4
[d72c0c255aa17c7f]
|
27,875,017 |
3C914A0B |
|
Section 3.5: Applications\1 - Dictionary.mp4
[1ea4f9d944df4aa0]
|
29,345,299 |
C66C7822 |
|
Section 3.5: Applications\3 - Sparse Vectors.mp4
[3fec69309ee045a7]
|
54,398,109 |
9FD9CCCA |
|
Section 4.1: Undirected Graphs |
0 |
00000000 |
|
Section 4.1: Undirected Graphs\1 - Graph API.mp4
[e27b6108a2d9147d]
|
70,995,498 |
EBFA853A |
|
Section 4.1: Undirected Graphs\2 - Depth-First Search.mp4
[b31d3173dbe0d16]
|
117,153,516 |
17072BD4 |
|
Section 4.1: Undirected Graphs\5 - Graph Challenges.mp4
[2302e168c94a71e6]
|
100,600,599 |
C3A37E8C |
|
Section 4.1: Undirected Graphs\4 - Connected Components.mp4
[dda723bdd14292ac]
|
77,728,420 |
EC45B28F |
|
Section 4.1: Undirected Graphs\3 - Breadth-First Search.mp4
[a3e84c5c809604c]
|
61,972,354 |
F9127E78 |
|
Section 4.1: Undirected Graphs\0 - Introduction to Graphs.mp4
[486a1fd63f2119d7]
|
50,014,778 |
03648266 |
|
Section 4.2: Directed Graphs |
0 |
00000000 |
|
Section 4.2: Directed Graphs\4 - Strong Components.mp4
[b2c7b016da4ffe0e]
|
79,545,100 |
4CEDE6B4 |
|
Section 4.2: Directed Graphs\1 - Digraph API.mp4
[f30d79465af2277d]
|
25,983,255 |
E60AAC31 |
|
Section 4.2: Directed Graphs\2 - Digraph Search.mp4
[4e71950a552ac80c]
|
86,515,634 |
8F54C20F |
|
Section 4.2: Directed Graphs\3 - Topological Sort.mp4
[1b1a2318d4ce8ade]
|
53,140,466 |
13C113BE |
|
Section 4.2: Directed Graphs\0 - Introduction to Digraphs.mp4
[19f5f69d6975e6ee]
|
47,752,986 |
662E1077 |
|
Section 4.3: Minimum Spanning Trees |
0 |
00000000 |
|
Section 4.3: Minimum Spanning Trees\5 - MST Context.mp4
[177315ea22360404]
|
55,605,543 |
3EFAEEA9 |
|
Section 4.3: Minimum Spanning Trees\2 - Edge-Weighted Graph API.mp4
[8b9113bc8406cba1]
|
48,507,960 |
8B0E222C |
|
Section 4.3: Minimum Spanning Trees\0 - Introduction to MSTs.mp4
[35244432be8efd72]
|
26,865,701 |
4A7738AF |
|
Section 4.3: Minimum Spanning Trees\1 - Greedy Algorithm.mp4
[610ae9f0421f0969]
|
60,118,046 |
98076E95 |
|
Section 4.4: Shortest Paths |
0 |
00000000 |
|
Section 4.4: Shortest Paths \0 - Shortest Paths APIs.mp4
[f68a0f1b64c1926f]
|
51,042,039 |
A47FE97B |
|
Section 4.4: Shortest Paths \1 - Shortest Path Properties.mp4
[a932f832427524d3]
|
64,392,227 |
2E8AE76F |
|
| Total size: |
6,561,588,684 |
|
|
