CS 227
Algorithms II
Instructor: Richard Nau
Office Hours: Office Hours
Computer Algorithms is the study of the design and analysis of effective,
efficienct and clear methods for solving problems on computers; general methods
include divide and conquer, greedy methods, dynamic programming, backtrack,
sorting, and basic search and traversal techniques. We conclude with computational complexity, which is the classification of the difficulties inherent in problems no matter how powerful computers will ever be.
Items of note: