Math 340 -- Analysis of Algorithms (also called Computer Science 340) 

Math 340 presents qualitative and quantitative analyses of algorithms and their corresponding data structures, from a precise mathematical point of view. Particular classes of algorithms, such as sorting and searching, are covered in detail.

This course is not a requirement for the math major or minor, but it can be counted as a 300-level elective toward either the major or the minor.

Prerequisites: Math/Computer Science 231, Computer Science 206, and some additional mathematics at the 200 level, or consent of instructor.

Who should take this course?
Math majors or minors
Computer science majors or concentrators

Topics covered:
Performance bounds
Asymptotic and probabilistic analysis
Worst-case and average-case behavior
Correctness and complexity


---

For detailed information about Math 340 this year, please consult the list of Fall Courses and Spring Courses linked to the Mathematics and Statistics Home Page.