Skip to content

AlessandroCorradini/Stanford-University-Algorithms-Design-and-Analysis

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
01 - Introduction
01 - Introduction
 
 
02 - Asymptotic Analysis
02 - Asymptotic Analysis
 
 
03 - Divide & Conquer Algorithms
03 - Divide & Conquer Algorithms
 
 
04 - Homework 1
04 - Homework 1
 
 
05 - The Master Method
05 - The Master Method
 
 
06 - Quicksort Algorithm
06 - Quicksort Algorithm
 
 
07 - Quicksort Analysis
07 - Quicksort Analysis
 
 
08 - Probability Review
08 - Probability Review
 
 
09 - Homework 2
09 - Homework 2
 
 
10 - Linear-Time Selection
10 - Linear-Time Selection
 
 
11 - Graphs and the Contraction Algorithm
11 - Graphs and the Contraction Algorithm
 
 
12 - Homework 3
12 - Homework 3
 
 
13 - Graph Search and Connectivity
13 - Graph Search and Connectivity
 
 
14 - Homework 4
14 - Homework 4
 
 
15 - Dijkstra's Shortest-Path Algorithm
15 - Dijkstra's Shortest-Path Algorithm
 
 
16 - Heaps
16 - Heaps
 
 
17 - Balanced Binary Search Trees
17 - Balanced Binary Search Trees
 
 
18 - Homework 5
18 - Homework 5
 
 
19 - Hashing - The Basics
19 - Hashing - The Basics
 
 
20 - Universal Hashing
20 - Universal Hashing
 
 
21 - Bloom Filters
21 - Bloom Filters
 
 
22 - Homework 6
22 - Homework 6
 
 
23 - Final Exam 1
23 - Final Exam 1
 
 
24 - Introduction Part 2
24 - Introduction Part 2
 
 
25 - Two Motivation Applications
25 - Two Motivation Applications
 
 
26 - Introduction to Greedy Algorithms
26 - Introduction to Greedy Algorithms
 
 
27 - A Scheduling Application
27 - A Scheduling Application
 
 
28 - Prim's Minimum Spanning Tree Algorithm
28 - Prim's Minimum Spanning Tree Algorithm
 
 
29 - Homework 1
29 - Homework 1
 
 
30 - Kruskal's Minimum Spanning Tree Algorithm
30 - Kruskal's Minimum Spanning Tree Algorithm
 
 
31 - Clustering
31 - Clustering
 
 
32 - Advanced Union-Find
32 - Advanced Union-Find
 
 
33 - Huffman Codes
33 - Huffman Codes
 
 
34 - Homework 2
34 - Homework 2
 
 
35 - Introduction to Dynamic Programming
35 - Introduction to Dynamic Programming
 
 
36 - The Knapsack Problem
36 - The Knapsack Problem
 
 
37 - Sequence Alignment
37 - Sequence Alignment
 
 
38 - Optimal Binary Search Trees
38 - Optimal Binary Search Trees
 
 
39 - Homework 3
39 - Homework 3
 
 
40 - The Bellman-Ford Algorithm
40 - The Bellman-Ford Algorithm
 
 
41 - All-Pairs Shortest Paths
41 - All-Pairs Shortest Paths
 
 
42 - Homework 4
42 - Homework 4
 
 
43 - NP-Complete Problems
43 - NP-Complete Problems
 
 
44 - Faster Exact Algorithms for NP-Complete Problems
44 - Faster Exact Algorithms for NP-Complete Problems
 
 
45 - Homework 5
45 - Homework 5
 
 
46 - Approximation Algorithms for NP-Complete Problems
46 - Approximation Algorithms for NP-Complete Problems
 
 
47 - Local Search Algorithms
47 - Local Search Algorithms
 
 
48 - The Wider World of Algorithms
48 - The Wider World of Algorithms
 
 
49 - Homework 6
49 - Homework 6
 
 
50 - Final Exam
50 - Final Exam
 
 
.gitattributes
.gitattributes
 
 
README.md
README.md
 
 
READMEmd
READMEmd
 
 

Repository files navigation

Stanford-University-Algorithms-Design-and-Analysis

Algorithms - Design and Analysis offered by Stanford University

About

Algorithms - Design and Analysis offered by Stanford University

Topics

algorithm algorithms mooc stanford-university stanford algorithm-analysis algorithms-datastructures moocs algorithms-and-data-structures stanford-online stanford-algs stanford-course

Resources

Readme
Activity

Stars

35 stars

Watchers

1 watching

Forks

16 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors