Editing MA/CSSE473 - Design and Analysis of Algorithms (section)

== Advice for Students Taking MA/CSSE473 ==
Langley is fantastic, Eldredge has been noted as another good professor. By the time most students will be taking this class, they should know how to find good professors anyway.

The proofs in comparison to other CS/MA courses are very simplistic. As long as you're comfortable with the math from CSSE230 and MA376, this is a fairly easy class. If you tend to struggle in math-heavy courses, review your notes from CSSE230 on recurrence relations and big-O notation so that you're comfortable in the early parts of the quarter.

==== Content ====
Prof. Langley's notes from Winter 2023/24 are linked [https://drive.google.com/file/d/12lpZHPeW73esEluhUqlEgSaNYT2eNY0Z/view?usp=drive_link here].

==== Homework ====
Homework assignments tend to be relatively straightforward - just apply the concepts from class and make sure you ask questions ahead of time if a problem looks particularly difficult. Langley generally is willing to give away most of the solution as long as someone asks during class.