Analyzing & Designing Algorithms

Analyzing & Designing Algorithms

Insertion Sort and Merge sort

Asymptotic Notation

Growth of Functions

Heapsort

Recursion & Induction

Divide and Conquer

Dynamic Programming

Dynamic Programming

Greedy Algorithms

Greedy Algorithms

Knapsack Problem(중요)

— — — -

Elementary Graph Algorithms

Problems & Terms

BFS (Breadth-First Search)

Strongly Connected Components

Critical Path

Bi-connected components