| Instructor: | Nathan Sommer |
| Office: | Taylor 313 |
| Email: | nsommer@wooster.edu |
| Office Hours: | Book here 10:30-11:30 M, 8:30-9:30 T, 1:30-2:30 W, 3-4 Th, 2-3 F |
| TA: | Nicole Powell |
| TA Office Hours: | 1-2 PM Tuesdays and Thursdays on Teams |
This course covers algorithms commonly encountered in computer science. Sorting, recursion, greedy strategies, and dynamic programming techniques are examined, as well as algorithms which utilize graphs and trees. Time and space complexity analysis is also covered, including the limitation of algorithms in the context of NP-completeness.
Introduction to Algorithms, 3rd Edition, Cormen et. al.