CS5800 (Algorithms) course reviews and ratings at Northeastern (NEU). Average rating 2.8/5. Compare professors with RateMyProfessor reviews.
Presents the mathematical techniques used for the design and analysis of computer algorithms. Focuses on algorithmic design paradigms and techniques for analyzing the correctness, time, and space complexity of algorithms. Topics may include asymptotic notation, recurrences, loop invariants, Hoare triples, sorting and searching, advanced data structures, lower bounds, hashing, greedy algorithms, dynamic programming, graph algorithms, and NP-completeness.
Data updated October 2026.