Udacity Intro to Algorithms Videos | E7364A8D79BA26BEBE1E28DD400B25411A910A87

Udacity Intro to Algorithms Videos

Name	Udacity - Intro to Algorithms Videos	DOWNLOAD Copy Link
Total Size	3.5 GB
Total Files	571
Hash	E7364A8D79BA26BEBE1E28DD400B25411A910A87

/Lesson 3_ Basic Graph Algorithms/
28 - Bridge Edges.mp4	45.5 MB
30 - Finding Bridge Edges.mp4	40.9 MB
24 - BFS Code.mp4	36.8 MB
17 - Recursion Replacement.mp4	33.7 MB
15 - Pairwise Shortest Path.mp4	31.4 MB
05 - Clustering Coefficient.mp4	30.4 MB
03 - Properties of Social Networks.mp4	29.3 MB
11 - Connected Components Code.mp4	29.0 MB
04 - Properties of Social Networks.mp4	26.3 MB
12 - Running Time of Connected Component.mp4	25.7 MB
31 - Proof.mp4	24.6 MB
25 - Single Source Shortest Paths.mp4	22.0 MB
27 - Centrality.mp4	20.3 MB
08 - Clustering Coefficient Code.mp4	17.4 MB
20 - Breadth First without Recursion.mp4	17.2 MB
14 - Checking Pairwise Connectivity.mp4	16.3 MB
16 - Depth vs Breadth First Search.mp4	14.3 MB
18 - Depth First without Recursion.mp4	10.5 MB
02 - Initial Foray.mp4	10.5 MB
23 - Marvel Social Network.mp4	10.1 MB
07 - Clustering Coefficient Quiz.mp4	9.7 MB
09 - Connected Components.mp4	9.1 MB
01 - Initial Foray.mp4	8.4 MB
06 - Clustering Coefficient Quiz.mp4	8.2 MB
10 - Connected Components.mp4	8.0 MB
26 - Single Source Shortest Paths.mp4	7.0 MB
19 - Depth First without Recursion.mp4	6.7 MB
13 - Checking Pairwise Connectivity.mp4	4.6 MB
29 - Bridge Edges.mp4	4.4 MB
22 - Searching a Tree.mp4	3.9 MB
21 - Searching a Tree.mp4	3.3 MB
/Lesson 6_ Hardness of Network Problems/
41 - Gadgets.mp4	43.2 MB
36 - Reduce 3-Colorability to SAT.mp4	34.6 MB
14 - Reduction Long and Simple Path.mp4	32.5 MB
40 - Making a SAT graph.mp4	28.5 MB
17 - Accepting Certificate.mp4	28.3 MB
06 - Degrees of Hardness.mp4	24.9 MB
44 - Coloring Planar Graphs.mp4	24.1 MB
27 - Find the Strangers.mp4	23.2 MB
10 - Decision Problems.mp4	22.8 MB
23 - Exponential Upperbound.mp4	22.8 MB
13 - Reduction Long and Simple Path.mp4	21.7 MB
39 - Reduce SAT to 3-Colorability.mp4	21.0 MB
16 - Non-deterministic Polynomial Time Decidable Problem.mp4	20.9 MB
08 - Lower Bound on Complexity.mp4	20.6 MB
22 - Good Guessing.mp4	20.3 MB
33 - Graph Coloring is NP-Complete.mp4	20.1 MB
31 - NP-Completeness.mp4	20.1 MB
24 - PNP.mp4	19.5 MB
05 - Exponential Running Time.mp4	18.2 MB
09 - Lower Bound on Complexity.mp4	17.8 MB
29 - Reducing to Clique.mp4	17.3 MB
11 - Longest Simple Path.mp4	17.0 MB
30 - SAT is NP-Hard.mp4	15.8 MB
38 - Generating a Formula.mp4	15.5 MB
43 - 4-Colorabiity.mp4	15.4 MB
03 - Tetristan.mp4	15.4 MB
25 - PNP.mp4	15.2 MB
42 - 4-Colorabiity.mp4	13.9 MB
34 - Solving 3-Colorability.mp4	13.7 MB
21 - Clique Problem in NP.mp4	12.9 MB
32 - NP-Completeness.mp4	12.8 MB
26 - NP-Hard.mp4	12.5 MB
20 - Clique Problem.mp4	11.9 MB
02 - Tetristan.mp4	11.7 MB
35 - Solving 3-Colorability.mp4	11.2 MB
04 - Efficient Algorithms.mp4	10.7 MB
37 - Generating a Formula.mp4	8.7 MB
18 - Accepting Certificate.mp4	8.5 MB
07 - Degrees of Hardness.mp4	8.2 MB
15 - Polynomial Time Decidable Problems.mp4	8.1 MB
19 - Clique Problem.mp4	7.1 MB
45 - Wrap Up.mp4	6.7 MB
12 - Longest Simple Path.mp4	4.4 MB
01 - Introduction.mp4	2.8 MB
28 - Find the Strangers.mp4	1.1 MB
/Problem Set 2 Solutions/
2 - Subsets.mp4	42.2 MB
5 - Combination Locks.mp4	20.1 MB
7 - Erdos Renyi.mp4	6.5 MB
3 - Function Comparision.mp4	5.9 MB
6 - Make A Combination Lock.mp4	5.9 MB
4 - Planar Graphs.mp4	5.7 MB
1 - Star Network.mp4	3.2 MB
/Lesson 5_ Strong and Weak Bonds/
11 - How to Find the Shortest Path.mp4	40.3 MB
25 - Randomizing Clustering Coefficient.mp4	37.4 MB
07 - Matrix Multiplication.mp4	30.2 MB
24 - Floyd-Warshall.mp4	27.2 MB
15 - Code for Dijkstra.mp4	26.5 MB
20 - Using Heaps.mp4	26.1 MB
27 - Bounds on the Estimate.mp4	25.8 MB
23 - Floyd-Warshall Intro.mp4	23.4 MB
06 - Strength of Connections.mp4	21.9 MB
08 - Weighted Social Networks.mp4	18.4 MB
02 - Save the Turtles.mp4	15.6 MB
26 - Randomizing Clustering Coefficient.mp4	14.6 MB
13 - Simulate this Algorithm.mp4	14.3 MB
18 - Implementing Shortest Distance.mp4	13.2 MB
05 - Strength of Connections.mp4	12.5 MB
19 - Implementing Shortest Distance.mp4	11.2 MB
21 - Using Heaps.mp4	11.1 MB
22 - All Pairs Shortest Paths.mp4	10.9 MB
04 - Make a Tree.mp4	9.2 MB
14 - Dijkstras Shortest Path Algorithm.mp4	8.1 MB
16 - What is Missing.mp4	7.6 MB
03 - Save the Turtles.mp4	5.7 MB
12 - Simulate this Algorithm.mp4	5.4 MB
10 - Find the Shortest Path.mp4	4.6 MB
01 - Introduction.mp4	4.4 MB
17 - What is Missing.mp4	4.4 MB
09 - Find the Shortest Path.mp4	2.9 MB
/Lesson 4_ It's Who You Know/
41 - Down Heapify.mp4	35.2 MB
27 - Analysis Of Top K.mp4	34.3 MB
19 - Top K Problem.mp4	32.1 MB
21 - Randomized Top K.mp4	30.7 MB
50 - Inserting Elements.mp4	22.2 MB
02 - Introduction.mp4	22.0 MB
20 - Top K Problem Solution.mp4	22.0 MB
44 - Build Heap.mp4	21.8 MB
25 - Three Partitioning Cases.mp4	21.0 MB
30 - Heaps Of Fun Solution.mp4	19.7 MB
03 - Introduction Solution.mp4	19.6 MB
26 - Top K Code.mp4	18.8 MB
29 - Heaps Of Fun.mp4	15.5 MB
31 - Heap Height.mp4	15.2 MB
45 - Remove Min.mp4	14.4 MB
14 - Extreme Values.mp4	14.4 MB
11 - Statistics On Unsorted Lists.mp4	14.1 MB
24 - Top K Via Partitioning.mp4	13.8 MB
22 - Partitioning Around V.mp4	13.5 MB
28 - Top K Summary.mp4	13.1 MB
37 - Establishing The Heap Property.mp4	13.1 MB
15 - Extreme Values Solution.mp4	12.5 MB
16 - Order Statistics.mp4	12.4 MB
36 - Heap Number Solution.mp4	12.3 MB
23 - Partitioning Around V Solution.mp4	12.0 MB
18 - Code For 2nd Highest.mp4	12.0 MB
04 - Types Of Centrality.mp4	10.5 MB
40 - Patch Up A Heap Solution.mp4	10.1 MB
07 - Computing Statistics.mp4	10.0 MB
09 - Statistics By Sorting.mp4	9.4 MB
35 - Heap Number.mp4	9.2 MB
08 - Types Of Statistics.mp4	9.1 MB
38 - Establishing The Heap Property Solution.mp4	8.4 MB
17 - Order Statistics Solution.mp4	8.2 MB
12 - Mean.mp4	7.4 MB
33 - Properties Of A Heap.mp4	7.2 MB
46 - Remove Min Solution.mp4	6.8 MB
39 - Patch Up A Heap.mp4	6.3 MB
10 - Statistics By Sorting Solution.mp4	5.7 MB
32 - Heap Height Solution.mp4	4.5 MB
49 - Heap Sort Performance Solution.mp4	4.1 MB
01 - Welcome.mp4	3.9 MB
34 - Properties Of A Heap Solution.mp4	3.8 MB
05 - Degree Centrality.mp4	3.7 MB
47 - Heap Sort.mp4	3.7 MB
42 - Running Time Of Down Heapify.mp4	3.6 MB
43 - Running Time Of Down Heapify Solution.mp4	3.5 MB
48 - Heap Sort Performance.mp4	3.2 MB
06 - Degree Centrality Solution.mp4	2.3 MB
13 - Mean Solution.mp4	2.1 MB
/Lesson 7/
22 - Pathway That Can Use Two Nodes.mp4	34.4 MB
/Lesson 1_ A Social Network Magic Trick/
02 - Magic Trick.mp4	31.5 MB
09 - Correctness Naive.mp4	27.7 MB
28 - Divide And Conquer.mp4	24.2 MB
04 - Eulerian Path.mp4	23.3 MB
07 - Case Study.mp4	22.6 MB
15 - Correctness Russian.mp4	21.1 MB
06 - Algorithms Are Cool.mp4	20.2 MB
05 - Eulerian Path Solution.mp4	19.6 MB
03 - Magic Trick.mp4	18.8 MB
14 - Example.mp4	18.6 MB
25 - Halving.mp4	17.3 MB
27 - Steps For Russian.mp4	17.1 MB
19 - Measuring Time.mp4	14.9 MB
29 - Recurrence Relation.mp4	14.3 MB
10 - Running Time.mp4	14.2 MB
21 - Counting Steps.mp4	13.2 MB
22 - Counting Steps Solution.mp4	10.5 MB
12 - Russian Peasants Algorithm.mp4	9.0 MB
18 - Which Is Faster.mp4	8.7 MB
08 - Case Study Solution.mp4	8.5 MB
17 - How Many Additions Solution.mp4	8.0 MB
30 - Recurrence Relation Solution.mp4	7.9 MB
01 - Introduction.mp4	6.4 MB
26 - Halving Solution.mp4	6.2 MB
13 - Russian Peasants Algorithm Solution.mp4	5.5 MB
23 - Steps For Naive.mp4	4.6 MB
11 - Running Time.mp4	4.1 MB
24 - Steps For Naive Solution.mp4	4.0 MB
20 - Measuring Time Solution.mp4	2.0 MB
16 - How Many Additions.mp4	2.0 MB
/Lesson 2_ Growth Rates in Social Networks/
06 - Ring Network.mp4	31.3 MB
12 - Big-Theta Examples.mp4	24.0 MB
37 - Tangled Hypercube Solution.mp4	22.8 MB
35 - N Squared.mp4	20.4 MB
24 - Hypercube.mp4	18.8 MB
20 - Eulers Formula.mp4	17.7 MB
09 - Big-Theta.mp4	16.7 MB
29 - Randomly Generated Graphs.mp4	16.7 MB
08 - Grid Network Solution.mp4	15.9 MB
04 - Chain Network.mp4	14.0 MB
23 - Complete Graph Solution.mp4	13.7 MB
16 - Planar Graphs.mp4	13.4 MB
11 - Big-Theta Reflexive.mp4	12.0 MB
30 - Recursive Graphs.mp4	11.0 MB
32 - Recurrence Relation.mp4	10.9 MB
02 - Divisible By Five.mp4	10.9 MB
22 - Complete Graph.mp4	10.5 MB
31 - Recursive Graphs Solution.mp4	9.9 MB
28 - Tree Graphs.mp4	9.5 MB
21 - Growth Rates.mp4	9.0 MB
03 - Divisible By Five Solution.mp4	8.0 MB
10 - Big-Theta Reflexive.mp4	7.9 MB
17 - Nodes, Edges, Regions.mp4	7.9 MB
34 - Number Of Edges.mp4	7.6 MB
15 - Big-Theta Practice.mp4	7.4 MB
36 - Tangled Hypercube.mp4	7.1 MB
07 - Grid Network.mp4	6.7 MB
26 - Hypercube Edges Solution.mp4	6.6 MB
13 - Other sets of Functions.mp4	6.1 MB
38 - Recap.mp4	4.9 MB
14 - Big-Theta Practice.mp4	4.6 MB
01 - Introduction.mp4	3.7 MB
33 - Recurrence Relation Solution.mp4	3.3 MB
19 - Regions In A Planar Graph Solution.mp4	3.0 MB
25 - Hypercube Edges.mp4	2.8 MB
27 - Tree Graphs.mp4	2.5 MB
05 - Chain Network Solution.mp4	1.2 MB
18 - Regions In A Planar Graph.mp4	940.9 KB
/Problem Set 4 Solutions/
2 - Up Heapify.mp4	19.8 MB
3 - Actor Centrality.mp4	9.2 MB
/Extra Challenge Problems/
1 - Top Two.mp4	14.0 MB
/Problem Set 1/
06 - Create Graph With Eulerian Tour Solution.mp4	13.7 MB
17 - General Clique Solution.mp4	6.7 MB
15 - Clique Solution.mp4	6.3 MB
04 - Counting Eulerian Paths Solution.mp4	5.1 MB
02 - Eulerian Path Solution.mp4	5.0 MB
18 - Challenge Find Eulerian Tour.mp4	3.5 MB
05 - Create Graph With Eulerian Tour.mp4	3.1 MB
07 - Representing A Graph.mp4	3.0 MB
11 - Recursive Naive Solution.mp4	2.8 MB
09 - Naive Multiplication Algorithm Solution.mp4	2.2 MB
01 - Eulerian Path.mp4	2.0 MB
08 - Naive Multiplication Algorithm.mp4	1.9 MB
12 - Russian Multiplication Algorithm.mp4	1.9 MB
14 - Clique.mp4	1.8 MB
16 - General Clique.mp4	1.6 MB
10 - Recursive Naive.mp4	1.4 MB
13 - Russian Multiplication Algorithm Solution.mp4	1.3 MB
03 - Counting Eulerian Paths.mp4	1.2 MB
/Problem Set 2/
2 - Recurrence Relation.mp4	12.6 MB
3 - Subsets.mp4	7.9 MB
1 - Star Network.mp4	2.9 MB
6 - Combination Locks.mp4	2.6 MB
4 - Function Comparision.mp4	2.5 MB
5 - Planar Graphs.mp4	2.2 MB
7 - Make A Combination Lock.mp4	1.7 MB
8 - Erdos-Renyi.mp4	1.6 MB
/Problem Set 3 Solutions/
1 - Clustering Coefficient.mp4	8.9 MB
4 - Bipartite III.mp4	8.0 MB
3 - Bipartite II.mp4	5.8 MB
2 - Bipartite I.mp4	4.8 MB
5 - Bipartite IV.mp4	3.5 MB
7 - Centrality.mp4	696.3 KB
6 - Mark Component.mp4	696.3 KB
8 - Bridge Edges.mp4	696.3 KB
/Problem Set 3/
2 - Bipartite I.mp4	5.5 MB
8 - Eulerian Tour Revisited.mp4	4.1 MB
1 - Clustering Coefficient.mp4	3.4 MB
7 - Centrality.mp4	2.9 MB
4 - Bipartite III.mp4	1.1 MB
6 - Mark Component.mp4	1.1 MB
5 - Bipartite IV.mp4	1.0 MB
3 - Bipartite II.mp4	544.5 KB
/Problem Set 4/
1 - Build a Heap.mp4	1.6 MB
/Lesson 7/
06 - Names And Boxes Problem.srt	11.2 KB
12 - Getting To Point B.srt	10.8 KB
08 - Statistical Measures In Networks.srt	8.9 KB
16 - Social Algorithms.srt	8.3 KB
02 - Spy Control Setup.srt	6.4 KB
20 - Duncan Watts.srt	5.5 KB
05 - Puzzles and Algorithms.srt	5.3 KB
11 - Social Networks In Security And Politics.srt	5.2 KB
15 - Practical Algorithms.srt	4.2 KB
22 - Pathway That Can Use Two Nodes.srt	3.6 KB
18 - Learning More About Crunching Social Networks.srt	3.6 KB
19 - The Future.srt	3.4 KB
25 - Wrap Up.srt	2.6 KB
13 - Networks.srt	2.2 KB
14 - Networks.srt	1.7 KB
17 - Algorithms In Industry.srt	1.6 KB
07 - Big Data.srt	1.6 KB
04 - Spy Control Solution.srt	1.5 KB
21 - Intro to Music Video.srt	1.2 KB
09 - Homophily.srt	1.0 KB
01 - Intro.srt	0.7 KB
03 - Spy Control.srt	0.6 KB
23 - Intro to Graph Search Animation.srt	0.4 KB
10 - Homophily Solution.srt	0.2 KB
/.../Lesson 3_ Basic Graph Algorithms/
28 - Bridge Edges.srt	9.2 KB
30 - Finding Bridge Edges.srt	8.7 KB
24 - BFS Code.srt	7.5 KB
17 - Recursion Replacement.srt	6.8 KB
11 - Connected Components Code.srt	6.8 KB
05 - Clustering Coefficient.srt	6.1 KB
15 - Pairwise Shortest Path.srt	5.8 KB
12 - Running Time of Connected Component.srt	5.3 KB
03 - Properties of Social Networks.srt	4.8 KB
04 - Properties of Social Networks.srt	4.7 KB
25 - Single Source Shortest Paths.srt	4.7 KB
31 - Proof.srt	4.4 KB
27 - Centrality.srt	3.9 KB
08 - Clustering Coefficient Code.srt	3.7 KB
20 - Breadth First without Recursion.srt	3.3 KB
16 - Depth vs Breadth First Search.srt	3.0 KB
14 - Checking Pairwise Connectivity.srt	2.7 KB
09 - Connected Components.srt	2.0 KB
18 - Depth First without Recursion.srt	1.8 KB
02 - Initial Foray.srt	1.7 KB
10 - Connected Components.srt	1.7 KB
23 - Marvel Social Network.srt	1.4 KB
26 - Single Source Shortest Paths.srt	1.3 KB
06 - Clustering Coefficient Quiz.srt	1.2 KB
07 - Clustering Coefficient Quiz.srt	1.2 KB
19 - Depth First without Recursion.srt	1.2 KB
01 - Initial Foray.srt	1.1 KB
13 - Checking Pairwise Connectivity.srt	0.8 KB
29 - Bridge Edges.srt	0.6 KB
22 - Searching a Tree.srt	0.5 KB
21 - Searching a Tree.srt	0.5 KB
/.../Lesson 5_ Strong and Weak Bonds/
25 - Randomizing Clustering Coefficient.srt	8.1 KB
11 - How to Find the Shortest Path.srt	8.1 KB
07 - Matrix Multiplication.srt	6.3 KB
27 - Bounds on the Estimate.srt	5.7 KB
15 - Code for Dijkstra.srt	5.7 KB
20 - Using Heaps.srt	5.3 KB
24 - Floyd-Warshall.srt	5.2 KB
06 - Strength of Connections.srt	4.9 KB
23 - Floyd-Warshall Intro.srt	4.7 KB
08 - Weighted Social Networks.srt	4.3 KB
02 - Save the Turtles.srt	3.3 KB
26 - Randomizing Clustering Coefficient.srt	3.0 KB
18 - Implementing Shortest Distance.srt	3.0 KB
13 - Simulate this Algorithm.srt	2.8 KB
05 - Strength of Connections.srt	2.6 KB
22 - All Pairs Shortest Paths.srt	2.3 KB
19 - Implementing Shortest Distance.srt	2.2 KB
21 - Using Heaps.srt	2.1 KB
04 - Make a Tree.srt	1.8 KB
14 - Dijkstras Shortest Path Algorithm.srt	1.6 KB
16 - What is Missing.srt	1.6 KB
03 - Save the Turtles.srt	1.1 KB
12 - Simulate this Algorithm.srt	1.1 KB
17 - What is Missing.srt	1.0 KB
01 - Introduction.srt	0.9 KB
10 - Find the Shortest Path.srt	0.9 KB
09 - Find the Shortest Path.srt	0.6 KB
/.../Lesson 6_ Hardness of Network Problems/
41 - Gadgets.srt	7.9 KB
36 - Reduce 3-Colorability to SAT.srt	5.7 KB
14 - Reduction Long and Simple Path.srt	5.2 KB
17 - Accepting Certificate.srt	4.7 KB
40 - Making a SAT graph.srt	4.6 KB
06 - Degrees of Hardness.srt	4.5 KB
44 - Coloring Planar Graphs.srt	4.3 KB
27 - Find the Strangers.srt	4.1 KB
23 - Exponential Upperbound.srt	4.0 KB
10 - Decision Problems.srt	3.9 KB
22 - Good Guessing.srt	3.9 KB
08 - Lower Bound on Complexity.srt	3.8 KB
24 - PNP.srt	3.8 KB
31 - NP-Completeness.srt	3.7 KB
09 - Lower Bound on Complexity.srt	3.6 KB
13 - Reduction Long and Simple Path.srt	3.4 KB
39 - Reduce SAT to 3-Colorability.srt	3.4 KB
05 - Exponential Running Time.srt	3.3 KB
33 - Graph Coloring is NP-Complete.srt	3.3 KB
16 - Non-deterministic Polynomial Time Decidable Problem.srt	3.3 KB
29 - Reducing to Clique.srt	3.1 KB
30 - SAT is NP-Hard.srt	3.0 KB
25 - PNP.srt	2.9 KB
03 - Tetristan.srt	2.9 KB
43 - 4-Colorabiity.srt	2.7 KB
11 - Longest Simple Path.srt	2.7 KB
34 - Solving 3-Colorability.srt	2.6 KB
38 - Generating a Formula.srt	2.5 KB
35 - Solving 3-Colorability.srt	2.4 KB
21 - Clique Problem in NP.srt	2.4 KB
26 - NP-Hard.srt	2.2 KB
42 - 4-Colorabiity.srt	2.1 KB
04 - Efficient Algorithms.srt	2.1 KB
20 - Clique Problem.srt	1.9 KB
02 - Tetristan.srt	1.7 KB
07 - Degrees of Hardness.srt	1.6 KB
32 - NP-Completeness.srt	1.5 KB
18 - Accepting Certificate.srt	1.5 KB
37 - Generating a Formula.srt	1.5 KB
15 - Polynomial Time Decidable Problems.srt	1.3 KB
19 - Clique Problem.srt	1.2 KB
45 - Wrap Up.srt	1.1 KB
12 - Longest Simple Path.srt	0.7 KB
01 - Introduction.srt	0.4 KB
28 - Find the Strangers.srt	0.2 KB
/.../Lesson 1_ A Social Network Magic Trick/
02 - Magic Trick.srt	6.6 KB
07 - Case Study.srt	5.4 KB
28 - Divide And Conquer.srt	5.1 KB
09 - Correctness Naive.srt	5.1 KB
06 - Algorithms Are Cool.srt	5.1 KB
05 - Eulerian Path Solution.srt	4.6 KB
04 - Eulerian Path.srt	4.5 KB
03 - Magic Trick.srt	4.3 KB
15 - Correctness Russian.srt	4.1 KB
14 - Example.srt	4.0 KB
25 - Halving.srt	3.6 KB
19 - Measuring Time.srt	3.4 KB
27 - Steps For Russian.srt	3.4 KB
10 - Running Time.srt	3.0 KB
29 - Recurrence Relation.srt	3.0 KB
21 - Counting Steps.srt	3.0 KB
22 - Counting Steps Solution.srt	2.4 KB
18 - Which Is Faster.srt	2.1 KB
08 - Case Study Solution.srt	2.0 KB
12 - Russian Peasants Algorithm.srt	1.9 KB
30 - Recurrence Relation Solution.srt	1.8 KB
17 - How Many Additions Solution.srt	1.5 KB
01 - Introduction.srt	1.4 KB
26 - Halving Solution.srt	1.2 KB
13 - Russian Peasants Algorithm Solution.srt	1.1 KB
11 - Running Time.srt	1.0 KB
24 - Steps For Naive Solution.srt	0.9 KB
23 - Steps For Naive.srt	0.8 KB
16 - How Many Additions.srt	0.5 KB
20 - Measuring Time Solution.srt	0.4 KB
/.../Lesson 2_ Growth Rates in Social Networks/
06 - Ring Network.srt	6.3 KB
37 - Tangled Hypercube Solution.srt	5.2 KB
12 - Big-Theta Examples.srt	4.6 KB
35 - N Squared.srt	4.5 KB
24 - Hypercube.srt	4.2 KB
20 - Eulers Formula.srt	4.1 KB
29 - Randomly Generated Graphs.srt	4.1 KB
04 - Chain Network.srt	3.2 KB
08 - Grid Network Solution.srt	3.2 KB
23 - Complete Graph Solution.srt	3.0 KB
16 - Planar Graphs.srt	2.9 KB
09 - Big-Theta.srt	2.8 KB
31 - Recursive Graphs Solution.srt	2.7 KB
30 - Recursive Graphs.srt	2.7 KB
32 - Recurrence Relation.srt	2.6 KB
28 - Tree Graphs.srt	2.4 KB
02 - Divisible By Five.srt	2.3 KB
22 - Complete Graph.srt	2.2 KB
11 - Big-Theta Reflexive.srt	2.1 KB
34 - Number Of Edges.srt	1.9 KB
10 - Big-Theta Reflexive.srt	1.8 KB
17 - Nodes, Edges, Regions.srt	1.7 KB
21 - Growth Rates.srt	1.7 KB
15 - Big-Theta Practice.srt	1.6 KB
36 - Tangled Hypercube.srt	1.6 KB
03 - Divisible By Five Solution.srt	1.5 KB
07 - Grid Network.srt	1.5 KB
26 - Hypercube Edges Solution.srt	1.5 KB
38 - Recap.srt	1.3 KB
13 - Other sets of Functions.srt	1.2 KB
14 - Big-Theta Practice.srt	0.9 KB
01 - Introduction.srt	0.8 KB
33 - Recurrence Relation Solution.srt	0.7 KB
27 - Tree Graphs.srt	0.7 KB
25 - Hypercube Edges.srt	0.6 KB
19 - Regions In A Planar Graph Solution.srt	0.5 KB
18 - Regions In A Planar Graph.srt	0.3 KB
05 - Chain Network Solution.srt	0.2 KB
/.../Problem Set 2 Solutions/
2 - Subsets.srt	6.3 KB
5 - Combination Locks.srt	3.0 KB
6 - Make A Combination Lock.srt	1.2 KB
7 - Erdos Renyi.srt	1.2 KB
4 - Planar Graphs.srt	0.8 KB
3 - Function Comparision.srt	0.7 KB
1 - Star Network.srt	0.4 KB
/.../Lesson 4_ It's Who You Know/
27 - Analysis Of Top K.srt	6.0 KB
41 - Down Heapify.srt	6.0 KB
19 - Top K Problem.srt	5.5 KB
21 - Randomized Top K.srt	5.2 KB
50 - Inserting Elements.srt	4.3 KB
02 - Introduction.srt	4.0 KB
44 - Build Heap.srt	3.9 KB
30 - Heaps Of Fun Solution.srt	3.7 KB
20 - Top K Problem Solution.srt	3.5 KB
03 - Introduction Solution.srt	3.5 KB
25 - Three Partitioning Cases.srt	3.3 KB
26 - Top K Code.srt	3.1 KB
45 - Remove Min.srt	2.7 KB
29 - Heaps Of Fun.srt	2.6 KB
11 - Statistics On Unsorted Lists.srt	2.6 KB
31 - Heap Height.srt	2.6 KB
24 - Top K Via Partitioning.srt	2.6 KB
22 - Partitioning Around V.srt	2.5 KB
14 - Extreme Values.srt	2.5 KB
18 - Code For 2nd Highest.srt	2.4 KB
37 - Establishing The Heap Property.srt	2.3 KB
23 - Partitioning Around V Solution.srt	2.2 KB
28 - Top K Summary.srt	2.2 KB
15 - Extreme Values Solution.srt	1.9 KB
40 - Patch Up A Heap Solution.srt	1.9 KB
16 - Order Statistics.srt	1.8 KB
04 - Types Of Centrality.srt	1.8 KB
07 - Computing Statistics.srt	1.8 KB
36 - Heap Number Solution.srt	1.7 KB
09 - Statistics By Sorting.srt	1.7 KB
08 - Types Of Statistics.srt	1.7 KB
38 - Establishing The Heap Property Solution.srt	1.6 KB
35 - Heap Number.srt	1.5 KB
17 - Order Statistics Solution.srt	1.4 KB
46 - Remove Min Solution.srt	1.4 KB
33 - Properties Of A Heap.srt	1.3 KB
12 - Mean.srt	1.2 KB
39 - Patch Up A Heap.srt	1.1 KB
01 - Welcome.srt	1.0 KB
49 - Heap Sort Performance Solution.srt	0.8 KB
47 - Heap Sort.srt	0.7 KB
05 - Degree Centrality.srt	0.7 KB
32 - Heap Height Solution.srt	0.7 KB
34 - Properties Of A Heap Solution.srt	0.7 KB
10 - Statistics By Sorting Solution.srt	0.7 KB
43 - Running Time Of Down Heapify Solution.srt	0.7 KB
42 - Running Time Of Down Heapify.srt	0.6 KB
48 - Heap Sort Performance.srt	0.5 KB
13 - Mean Solution.srt	0.4 KB
06 - Degree Centrality Solution.srt	0.3 KB
/Problem Set 1/
06 - Create Graph With Eulerian Tour Solution.srt	3.6 KB
02 - Eulerian Path Solution.srt	1.3 KB
15 - Clique Solution.srt	1.1 KB
17 - General Clique Solution.srt	1.1 KB
04 - Counting Eulerian Paths Solution.srt	1.0 KB
18 - Challenge Find Eulerian Tour.srt	0.9 KB
07 - Representing A Graph.srt	0.8 KB
05 - Create Graph With Eulerian Tour.srt	0.8 KB
11 - Recursive Naive Solution.srt	0.6 KB
08 - Naive Multiplication Algorithm.srt	0.4 KB
01 - Eulerian Path.srt	0.4 KB
16 - General Clique.srt	0.4 KB
14 - Clique.srt	0.4 KB
12 - Russian Multiplication Algorithm.srt	0.4 KB
09 - Naive Multiplication Algorithm Solution.srt	0.3 KB
10 - Recursive Naive.srt	0.3 KB
13 - Russian Multiplication Algorithm Solution.srt	0.2 KB
03 - Counting Eulerian Paths.srt	0.2 KB
/.../Extra Challenge Problems/
1 - Top Two.srt	3.2 KB
/Problem Set 2/
2 - Recurrence Relation.srt	2.6 KB
3 - Subsets.srt	1.5 KB
1 - Star Network.srt	0.7 KB
6 - Combination Locks.srt	0.5 KB
4 - Function Comparision.srt	0.4 KB
5 - Planar Graphs.srt	0.3 KB
7 - Make A Combination Lock.srt	0.3 KB
8 - Erdos-Renyi.srt	0.2 KB
/.../Problem Set 3 Solutions/
1 - Clustering Coefficient.srt	1.8 KB
4 - Bipartite III.srt	1.5 KB
3 - Bipartite II.srt	1.3 KB
2 - Bipartite I.srt	1.0 KB
5 - Bipartite IV.srt	0.7 KB
6 - Mark Component.srt	0.1 KB
7 - Centrality.srt	0.1 KB
8 - Bridge Edges.srt	0.1 KB
/Problem Set 3/
7 - Centrality.srt	0.7 KB
8 - Eulerian Tour Revisited.srt	0.6 KB
1 - Clustering Coefficient.srt	0.5 KB
6 - Mark Component.srt	0.3 KB
4 - Bipartite III.srt	0.2 KB
5 - Bipartite IV.srt	0.2 KB
2 - Bipartite I.srt	0.1 KB
3 - Bipartite II.srt	0.1 KB
/Problem Set 4/
1 - Build a Heap.srt	0.3 KB
Total files 571