Course Syllabus, Grading, Policies
Primer on Mathematical Proofs
All the formulas you need!
Asymptotics
SelectionSort
InsertionSort
MergeSort
Reccurences
Heaps
Heapsort
Quicksort
Worst Case Analysis
Average Case Analysis
Lower Bounds
Counting Sort
Radix Sort
Bucket Sort
Order Stats 1 Min Max
Order Stats 2 Median of Medians
Order Stats 3 Quicksort
Binary Search Trees
Red Black Trees
Order Statistics Red Black Trees
Interval Trees
Parallel Disk Model
All you need to know about Binomial Heaps!
Amortized A. - Agg. Mtd
Amortized A. - Binary Cnt. Eg.
Amortized A. - Acc. Mtd
Amortized A. - Pot. Mtd
Amortized A. - Dyn. Tables
Binomial Heaps 1
Binomial Heaps 2
Binomial Heaps 3
Fibonacci Heaps 1
Fibonacci Heaps 2
Fibonacci Heaps 3
Fibonacci Heaps 4
Fibonacci Heaps 5
Dynamic Programming 1
Dynamic Programming 2
Dynamic Programming 3
Greedy Algo 1
Greedy Algo 2
Greedy Algo 3
Hashing 1
Hashing 2
Hashing 3
Hashing 4
Hashing 5
Hashing 6
Hashing 7
Hashing 8
BFS
DFS
SCC
MST
Bellman Ford
Dijkstra
Constraints
All Pairs Shortest Path
Floyd Warshall Johnson
Max Flow Problem
Augmenting Paths
Ford Fulkerson Edmonds Karp
Matching
Decision Problems
Encoding
Languages
NP
NPC
DTM
NTM
SAT to 3SAT
SAT to 3SAT proof
3SAT to VC
3SAT to VC Proof
Approx Algo VC
Approx Algo 3SAT
Computers and Intractability: A Guide to the Theory of NP-Completeness
where to look for ideas
where to get some data …
data