Intro to Algorithms

Catalog description

This course teaches techniques for the design and analysis of efficient algorithms. Topics include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing. (Previously NJCU Course CS-401)