CS317: Introduction to Design & Analysis of Algorithms
Complexity analysis; searching, sorting, finding spanning trees and shortest paths in graphs. Divide & conquer, dynamic programming, and backtracking. Intro to problem classification, i.e., NP, intractable, and unsolvable.