CSCI 255 - Introduction to Algorithms

An introduction to the design and analysis of algorithms. This course builds on the data structures topics from CSCI 235 by exploring efficient ways of using them to solve problems. Algorithm analysis topics include best, worst, and average case analysis of iterative and recursive algorithms; asymptotic notation; and solving recurrence relations. Algorithm design techniques include brute force, decrease-and-conquer, divide-and-conquer, greedy, dynamic programming, and space/time tradeoff.

Credits: 3
Terms Offered: Fall
Prerequisites: CSCI 235 with a grade of C- or better